Optimizing the Decoding Probability and Coverage Ratio of Composite DNA

TL;DR

This paper investigates optimizing decoding probability and coverage in composite DNA data storage by analyzing expected reads and mixture selection to enhance decoding success.

Contribution

It introduces methods to maximize decoding probability and coverage ratio in composite DNA storage, addressing the unique challenges of mixture-based nucleotide encoding.

Findings

Derived expected number of reads for decoding

Proposed mixture selection strategies for higher decoding probability

Enhanced decoding success rates demonstrated

Abstract

This paper studies two problems that are motivated by the novel recent approach of composite DNA that takes advantage of the DNA synthesis property which generates a huge number of copies for every synthesized strand. Under this paradigm, every composite symbols does not store a single nucleotide but a mixture of the four DNA nucleotides. The first problem studies the expected number of strand reads in order to decode a composite strand or a group of composite strands. In the second problem, our goal is study how to carefully choose a fixed number of mixtures of the DNA nucleotides such that the decoding probability by the maximum likelihood decoder is maximized.