Year: 2026
Type: article
Abstract: DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on minimizing the expected number of reads needed to recover information strands encoded via a linear code. We compute the asymptotic performance of a recently proposed code construction, establishing and refining a conjecture in the field by giving two independent proofs. We also analyze a geometric code construction based on balanced quasi-arcs and optimize its parameters. Finally, we investigate the full distribution of the random variables that arise in the coverage depth problem, of which the traditionally studied expectation is just the first moment. This allows us to distinguish between code constructions that, at first glance, may appear to behave identically.
Language: English
Topic: DNA and Biological Computing
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funders: National Science Foundation, Banco Santander, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, Irish Research Council, Nederlandse Organisatie voor Wetenschappelijk Onderzoek, National Board for Higher Mathematics, Indian Institute of Technology Bombay, Universidad de Valladolid, European Regional Development Fund, Agencia Estatal de Investigación
OpenAlex ID: W7167706783