{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T12:56:04Z","timestamp":1781873764535,"version":"3.54.5"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:00:00Z","timestamp":1781827200000},"content-version":"vor","delay-in-days":49,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2025YFA0920900"],"award-info":[{"award-number":["2025YFA0920900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tianjin Municipal Science and Technology Major Program","award":["25ZXWCSY00330"],"award-info":[{"award-number":["25ZXWCSY00330"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>DNA storage offers exceptional durability and density but remains constrained by high sequencing cost and limited throughput. Sequencing coverage depth is a key determinant of retrieval reliability and sequencing efficiency, yet its quantitative characterization requires realistic modeling of channel nonuniformity beyond idealized uniform assumptions. In this work, we develop a nonuniform coverage-depth analysis framework for DNA storage channels by modeling polymerase chain reaction and sequencing data, with a log-normal instantiation for the empirical channel distribution. The proposed framework covers both nonuniform noiseless and noisy channels and is used to analyze the MDS coverage depth problem. For the noiseless case, we derive the expected minimum sequencing coverage depth required for complete decoding under a nonuniform channel distribution. For the noisy case, we present two complementary theories: a coupon-collector-problem-based (CCP) theory that provides a conservative probabilistic envelope, and a critical-quantile-based theory (CQT) that refines the estimate by identifying the key coverage-depth range that determines whether most strands are recovered. We further compare the uniform-channel theory, CCP theory, and CQT theory across multiple code rates and retrieval parameters through extensive Monte Carlo simulations. To support practical use, we also develop an interactive web platform for parameter tuning and visualization. The resulting theory and platform provide theoretical foundations and practical tools for improving retrieval reliability and sequencing efficiency in DNA storage systems.<\/jats:p>","DOI":"10.1093\/bib\/bbag303","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:50:56Z","timestamp":1780055456000},"source":"Crossref","is-referenced-by-count":0,"title":["Modeling DNA storage retrieval reliability via sequencing coverage depth"],"prefix":"10.1093","volume":"27","author":[{"given":"Ruiying","family":"Cao","sequence":"first","affiliation":[{"name":"Center for Applied Mathematics, Tianjin University , 92 Weijin Road, Nankai District, Tianjin 300072 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Penghua","family":"Zhou","sequence":"additional","affiliation":[{"name":"Center for Applied Mathematics, Tianjin University , 92 Weijin Road, Nankai District, Tianjin 300072 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2521-6732","authenticated-orcid":false,"given":"Xin","family":"Chen","sequence":"additional","affiliation":[{"name":"Center for Applied Mathematics, Tianjin University , 92 Weijin Road, Nankai District, Tianjin 300072 ,","place":["China"]},{"name":"State Key Laboratory of Synthetic Biology, Frontiers Research Institute for Synthetic Biology, Tianjin University , 92 Weijin Road, Nankai District, Tianjin 300072 ,","place":["China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,6,19]]},"reference":[{"key":"2026061908190494300_ref1","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1038\/s41587-019-0240-x","article-title":"Data storage in DNA with fewer synthesis cycles using composite DNA letters","volume":"37","author":"Anavy","year":"2019","journal-title":"Nat Biotechnol"},{"key":"2026061908190494300_ref2","article-title":"Worldwide IDC Global DataSphere forecast, 2022\u20132026: enterprise organizations driving most of the data growth","volume-title":"Technical report","author":"Rydning","year":"2022"},{"key":"2026061908190494300_ref3","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","article-title":"Next-generation digital information storage in DNA","volume":"337","author":"Church","year":"2012","journal-title":"Science"},{"key":"2026061908190494300_ref4","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1002\/anie.201411378","article-title":"Robust chemical preservation of digital information on DNA in silica with error-correcting codes","volume":"54","author":"Grass","year":"2015","journal-title":"Angew Chem Int Ed"},{"key":"2026061908190494300_ref5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/s41576-019-0125-3","article-title":"Molecular digital data storage using DNA","volume":"20","author":"Ceze","year":"2019","journal-title":"Nat Rev Genet"},{"key":"2026061908190494300_ref6","doi-asserted-by":"publisher","article-title":"On the reliability of information retrieval from MDS coded data in DNA storage","author":"Hanna","DOI":"10.1109\/TMBMC.2026.3690724"},{"key":"2026061908190494300_ref7","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TIT.2024.3496587","article-title":"Cover your bases: how to minimize the sequencing coverage in DNA storage systems","volume":"71","author":"Bar-Lev","year":"2024","journal-title":"IEEE Trans Inf Theory"},{"key":"2026061908190494300_ref8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/ISIT57864.2024.10619092","article-title":"Covering all bases: the next inning in DNA sequencing efficiency","volume-title":"2024 IEEE International Symposium on Information Theory (ISIT)","author":"Abraham","year":"2024"},{"key":"2026061908190494300_ref9","doi-asserted-by":"publisher","first-page":"9395","DOI":"10.1109\/TIT.2025.3623202","article-title":"A combinatorial perspective on random access efficiency for DNA storage","volume":"71","author":"Gruica","year":"2025","journal-title":"IEEE Trans Inf Theory"},{"key":"2026061908190494300_ref10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TMBMC.2024.3408053","article-title":"Sequencing coverage analysis for combinatorial DNA-based storage systems","volume":"10","author":"Preuss","year":"2024","journal-title":"IEEE Trans Mol Biol Multi-Scale Commun"},{"key":"2026061908190494300_ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-41729-1","article-title":"A digital twin for DNA data storage based on comprehensive quantification of errors and biases","volume":"14","author":"Gimpel","year":"2023","journal-title":"Nat Commun"},{"key":"2026061908190494300_ref12","doi-asserted-by":"crossref","first-page":"2497","DOI":"10.1039\/D4DD00220B","article-title":"Challenges for error-correction coding in DNA data storage: photolithographic synthesis and DNA decay","volume":"3","author":"Gimpel","year":"2024","journal-title":"Digital Discovery"},{"key":"2026061908190494300_ref13","doi-asserted-by":"publisher","first-page":"9395","DOI":"10.1038\/s41467-024-53455-3","article-title":"Composite hedges nanopores codec system for rapid and portable DNA data readout with high indel-correction","volume":"15","author":"Zhao","year":"2024","journal-title":"Nat Commun"},{"key":"2026061908190494300_ref14","doi-asserted-by":"publisher","first-page":"7306","DOI":"10.1021\/acsnano.4c17817","article-title":"Ultrafast and accurate DNA storage and reading integrated system via microfluidic magnetic beads polymerase chain reaction","volume":"19","author":"Zhou","year":"2025","journal-title":"ACS Nano"},{"key":"2026061908190494300_ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ISIT63088.2025.11195510","article-title":"Optimizing sequencing coverage depth in DNA storage: insights from DNA storage data","volume-title":"2025 IEEE International Symposium on Information Theory (ISIT)","author":"Cao","year":"2025"},{"key":"2026061908190494300_ref16","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","article-title":"Maximum distance q-nary codes","volume":"10","author":"Singleton","year":"1964","journal-title":"IEEE Trans Inf Theory"},{"key":"2026061908190494300_ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6","article-title":"A characterization of the DNA data storage channel","volume":"9","author":"Heckel","year":"2019","journal-title":"Sci Rep"},{"key":"2026061908190494300_ref18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1239\/jap\/1222441818","article-title":"The generalised coupon collector problem","volume":"45","author":"Neal","year":"2008","journal-title":"J Appl Probab"},{"key":"2026061908190494300_ref19","first-page":"391","article-title":"A simple urn model dependent upon predetermined strategy","volume":"36","author":"Consul","year":"1974","journal-title":"Sankhy\u0101: Indian J Statistics, Ser B"},{"key":"2026061908190494300_ref20","volume-title":"An introduction to probability theory and its applications","author":"Feller","year":"1971"},{"key":"2026061908190494300_ref21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.2307\/2308930","article-title":"The double dixie cup problem","volume":"67","author":"Newman","year":"1960","journal-title":"Am Math Mon"},{"key":"2026061908190494300_ref22","first-page":"215","article-title":"On a classical problem of probability theory","volume":"6","author":"Erdo\u030bs","year":"1961","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"2026061908190494300_ref23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","article-title":"Birthday paradox, coupon collectors, caching algorithms and self-organizing search","volume":"39","author":"Flajolet","year":"1992","journal-title":"Discret Appl Math"},{"key":"2026061908190494300_ref24","doi-asserted-by":"publisher","first-page":"3344","DOI":"10.1021\/acssynbio.0c00419","article-title":"Low-bias manipulation of DNA oligo pool for robust data storage","volume":"9","author":"Gao","year":"2020","journal-title":"ACS Synth Biol"},{"key":"2026061908190494300_ref25","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1038\/156463a0","article-title":"Lognormal distributions","volume":"156","author":"Gaddum","year":"1945","journal-title":"Nature"},{"key":"2026061908190494300_ref26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2331554","article-title":"The probable error of a mean","volume":"6","author":"Student.","year":"1908","journal-title":"Biometrika"},{"key":"2026061908190494300_ref27","doi-asserted-by":"publisher","DOI":"10.1117\/3.626196","volume-title":"Laser beam propagation through random media, volume PM152 of SPIE Press Monograph","author":"Andrews","year":"2005"},{"key":"2026061908190494300_ref28","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1214\/aoms\/1177728549","article-title":"A characterization of the gamma distribution","volume":"26","author":"Lukacs","year":"1955","journal-title":"Ann Math Stat"},{"key":"2026061908190494300_ref29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1115\/1.4010337","article-title":"A statistical distribution function of wide applicability","volume":"18","author":"Weibull","year":"1951","journal-title":"J Appl Mech"},{"key":"2026061908190494300_ref30","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/3001850","article-title":"Fitting the negative binomial distribution to biological data","volume":"9","author":"Bliss","year":"1953","journal-title":"Biometrics"}],"container-title":["Briefings in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/27\/3\/bbag303\/68559166\/bbag303.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/27\/3\/bbag303\/68559166\/bbag303.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T12:19:16Z","timestamp":1781871556000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bib\/article\/doi\/10.1093\/bib\/bbag303\/8711665"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,4]]}},"URL":"https:\/\/doi.org\/10.1093\/bib\/bbag303","relation":{},"ISSN":["1467-5463","1477-4054"],"issn-type":[{"value":"1467-5463","type":"print"},{"value":"1477-4054","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,5]]},"published":{"date-parts":[[2026,5]]},"article-number":"bbag303"}}