{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:23:39Z","timestamp":1780449819943,"version":"3.54.1"},"reference-count":121,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,2,24]]},"abstract":"<jats:p>Due to its longevity and enormous information density, DNA is an attractive medium for archival data storage. Natural DNA more than 700.000 years old has been recovered, and about 5 grams of DNA can in principle hold a Zetabyte of digital information, orders of magnitude more than what is achieved on conventional storage media. Thanks to rapid technological advances, DNA storage is becoming practically feasible, as demonstrated by a number of experimental storage systems, making it a promising solution for our society's increasing need of data storage.<\/jats:p>\n                  <jats:p>While in living things, DNA molecules can consist of millions of nucleotides, due to technological constraints, in practice, data is stored on many short DNA molecules, which are preserved in a DNA pool and cannot be spatially ordered. Moreover, imperfections in sequencing, synthesis, and handling, as well as DNA decay during storage, introduce random noise into the system, making the task of reliably storing and retrieving information in DNA challenging.<\/jats:p>\n                  <jats:p>This unique setup raises a natural information-theoretic question: how much information can be reliably stored on and reconstructed from millions of short noisy sequences? The goal of this monograph is to address this question by discussing the fundamental limits of storing information on DNA. Motivated by current technological constraints on DNA synthesis and sequencing, we propose a probabilistic channel model that captures three key distinctive aspects of the DNA storage systems: (1) the data is written onto many short DNA molecules that are stored in an unordered fashion; (2) the molecules are corrupted by noise and (3) the data is read by randomly sampling from the DNA pool. Our goal is to investigate the impact of each of these key aspects on the capacity of the DNA storage system. Rather than focusing on coding-theoretic considerations and computationally efficient encoding and decoding, we aim to build an information-theoretic foundation for the analysis of these channels, developing tools for achievability and converse arguments.<\/jats:p>","DOI":"10.1561\/0100000117","type":"journal-article","created":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T04:26:41Z","timestamp":1645676801000},"page":"1-106","source":"Crossref","is-referenced-by-count":57,"title":["Information-Theoretic Foundations of DNA Data Storage"],"prefix":"10.1108","volume":"19","author":[{"given":"Ilan","family":"Shomorony","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reinhard","family":"Heckel","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Germany, and Rice University ,","place":["USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"2026032712181174500_ref001","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1109\/ISIT.2019.8849647","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Abroshan","year":"2019"},{"issue":"3","key":"2026032712181174500_ref002","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/140962486","article-title":"String reconstruction from substring compositions","volume":"29","author":"Acharya","year":"2015","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"2026032712181174500_ref003","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1109\/TIT.1987.1057313","article-title":"Optimal coding strategies for certain permuting channels","volume":"33","author":"Ahlswede","year":"1987","journal-title":"IEEE transactions on information theory"},{"issue":"2","key":"2026032712181174500_ref004","doi-asserted-by":"crossref","first-page":"R18","DOI":"10.1186\/gb-2011-12-2-r18","article-title":"Analyzing and minimizing pcr amplification bias in illumina sequencing libraries","volume":"12","author":"Aird","year":"2011","journal-title":"Genome biology"},{"issue":"10","key":"2026032712181174500_ref005","doi-asserted-by":"crossref","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":"Nature Biotechnology"},{"key":"2026032712181174500_ref006","article-title":"Glass: A new media for a new era?","volume-title":"10th { USENIX} Workshop on Hot Topics in Storage and File Systems (HotStorage 18)","author":"Anderson","year":"2018"},{"key":"2026032712181174500_ref007","doi-asserted-by":"crossref","DOI":"10.1038\/s41467-020-19148-3","article-title":"Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction","volume-title":"Nature Communications","author":"Antkowiak","year":"2020"},{"key":"2026032712181174500_ref008","first-page":"910","article-title":"Reconstructing strings from random traces","volume-title":"roceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Batu","year":"2004"},{"issue":"5210","key":"2026032712181174500_ref009","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1126\/science.7725109","article-title":"Building an associative memory vastly larger than the brain","volume":"268","author":"Baum","year":"1995","journal-title":"Science"},{"key":"2026032712181174500_ref010","volume-title":"Coding for a Noisy Channel with Permutation Errors","author":"Benjamin","year":"1975"},{"key":"2026032712181174500_ref011","article-title":"Trace reconstruction problems in computational biology","volume-title":"IEEE Transactions on Information Theory","author":"Bhardwaj","year":"2020"},{"key":"2026032712181174500_ref012","first-page":"1011","volume-title":"Procedia Computer Science, International Conference on Computational Science 2016, ICCS 2016, 6-8 June 2016","author":"Blawat","year":"2016"},{"issue":"1","key":"2026032712181174500_ref013","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1038\/nmeth.2276","article-title":"Qualityfiltering vastly improves diversity estimates from illumina amplicon sequencing","volume":"10","author":"Bokulich","year":"2013","journal-title":"Nature methods"},{"key":"2026032712181174500_ref014","first-page":"637","volume-title":"Proc. of ASPLOS","author":"Bornholt","year":"2016"},{"issue":"5","key":"2026032712181174500_ref015","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1109\/TIT.2017.2746566","article-title":"Efficient low- redundancy codes for correcting multiple deletions","volume":"64","author":"Brakensiek","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref016","doi-asserted-by":"crossref","DOI":"10.1042\/BST0390575","volume-title":"A brief review of DNA and rna chemical synthesis","author":"Caruthers","year":"2011"},{"key":"2026032712181174500_ref017","first-page":"147","volume-title":"2019 57th Annual Al lerton Conference on Communication, Control, and Computing (Al lerton)","author":"Chandak","year":"2019"},{"key":"2026032712181174500_ref018","first-page":"627","volume-title":"Annales de l\u2019Institut Henri Poincar\u00e9, Probabilit\u00e9s et Statistiques","author":"Chase","year":"2021"},{"key":"2026032712181174500_ref019","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/ISIT.2019.8849643","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Chee","year":"2019"},{"key":"2026032712181174500_ref020","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2019.8849437","article-title":"Efficient and explicit balanced primer codes","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Chee","year":"2019"},{"issue":"1","key":"2026032712181174500_ref021","doi-asserted-by":"crossref","first-page":"3264","DOI":"10.1038\/s41467-020-16958-3","article-title":"Quantifying molecular bias in dna data storage","volume":"11","author":"Chen","year":"2020","journal-title":"Nature Communications"},{"key":"2026032712181174500_ref022","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9781611976465.1","article-title":"Efficient linear and affine codes for correcting insertions\/deletions","volume-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), ser. Proceedings","author":"Cheng","year":"2021"},{"issue":"2","key":"2026032712181174500_ref023","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3281275","article-title":"Capacity upper bounds for deletion-type channels","volume":"66","author":"Cheraghchi","year":"2019","journal-title":"Journal of the ACM (JACM)"},{"key":"2026032712181174500_ref024","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2020.2996377","article-title":"Coded trace reconstruction","volume-title":"IEEE Transactions on Information Theory","author":"Cheraghchi","year":"2020"},{"key":"2026032712181174500_ref025","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2019.2920375","article-title":"Sharp analytical capacity upper bounds for sticky and related channels","volume-title":"IEEE Transactions on Information Theory","author":"Cheraghchi","year":"2019"},{"key":"2026032712181174500_ref026","first-page":"279","volume-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)","author":"Chrisnata","year":"2020"},{"issue":"6102","key":"2026032712181174500_ref027","doi-asserted-by":"crossref","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":"2026032712181174500_ref028","volume-title":"Linear and reed solomon codes against adversarial insertions and deletions","author":"Con","year":"2021"},{"key":"2026032712181174500_ref029","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1145\/3055399.3055450","article-title":"Optimal mean-based algorithms for trace reconstruction","volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","author":"De","year":"2017"},{"issue":"9","key":"2026032712181174500_ref030","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.tig.2018.05.008","article-title":"The third revolution in sequencing technology","volume":"34","author":"van Dijk","year":"2018","journal-title":"Trends in Genetics"},{"issue":"5","key":"2026032712181174500_ref031","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1093\/nar\/gkh340","article-title":"Muscle: Multiple sequence alignment with high accuracy and high throughput","volume":"32","author":"Edgar","year":"2004","journal-title":"Nucleic Acids Research"},{"key":"2026032712181174500_ref032","article-title":"Coding for two noisy channels","volume-title":"Information Theory, 3rd London Symposium, London, England, Sept. 1955","author":"Elias","year":"1955"},{"issue":"6328","key":"2026032712181174500_ref033","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA fountain enables a robust and efficient storage architecture","volume":"355","author":"Erlich","year":"2017","journal-title":"Science"},{"key":"2026032712181174500_ref034","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ITW.2015.7133171","article-title":"Asymmetric Lee distance codes: New bounds and constructions","volume-title":"2015 IEEE Information Theory Workshop (ITW)","author":"Gabrys","year":"2015"},{"key":"2026032712181174500_ref035","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/ISIT44484.2020.9174404","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Gabrys","year":"2020"},{"issue":"2","key":"2026032712181174500_ref036","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TIT.2018.2876281","article-title":"Codes correcting two deletions","volume":"65","author":"Gabrys","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712181174500_ref037","doi-asserted-by":"crossref","first-page":"2924","DOI":"10.1109\/TIT.2018.2800044","article-title":"Sequence reconstruction over the deletion channel","volume":"64","author":"Gabrys","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7435","key":"2026032712181174500_ref038","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low- maintenance information storage in synthesized DNA","volume":"494","author":"Goldman","year":"2013","journal-title":"Nature"},{"issue":"8","key":"2026032712181174500_ref039","doi-asserted-by":"crossref","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":"Angewandte Chemie International Edition"},{"issue":"10","key":"2026032712181174500_ref040","doi-asserted-by":"crossref","first-page":"6384","DOI":"10.1109\/TIT.2021.3069446","article-title":"Explicit two-deletion codes with redundancy matching the existential bound","volume":"67","author":"Guruswami","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref041","first-page":"152","article-title":"Repeated deletion channels","volume-title":"2014 IEEE Information Theory Workshop","author":"Haeupler","year":"2014"},{"key":"2026032712181174500_ref042","first-page":"33","article-title":"Synchronization strings: Codes for insertions and deletions approaching the singleton bound","volume-title":"ACM SIGACT Symposium on Theory of Computing","author":"Haeupler","year":"2017"},{"issue":"6","key":"2026032712181174500_ref043","doi-asserted-by":"crossref","first-page":"3190","DOI":"10.1109\/TIT.2021.3056317","article-title":"Synchronization strings and codes for insertions and deletions\u2014a survey","volume":"67","author":"Haeupler","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref044","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/1.9781611975062.6","volume-title":"2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)","author":"Hartung","year":"2018"},{"key":"2026032712181174500_ref045","volume-title":"Scalable techniques for clustering the web","author":"Haveliwala","year":"2000"},{"key":"2026032712181174500_ref046","unstructured":"R.\n              Heckel\n             and R.Grass, Instructions to encode the first Biohackers episode from DNA, Mar. 2021, URL: https:\/\/github.com\/reinhardh\/dna_rs_coding."},{"issue":"1","key":"2026032712181174500_ref047","doi-asserted-by":"crossref","first-page":"1","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":"Scientific Reports"},{"key":"2026032712181174500_ref048","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","volume-title":"Conference On Learning Theory","author":"Holden","year":"2018"},{"key":"2026032712181174500_ref049","first-page":"389","volume-title":"Proceedings of the nineteenth annual ACM- SIAM symposium on Discrete algorithms","author":"Holenstein","year":"2008"},{"issue":"10","key":"2026032712181174500_ref050","doi-asserted-by":"crossref","first-page":"6192","DOI":"10.1109\/TIT.2013.2262020","article-title":"Optimal coding for the binary deletion channel with small deletion probability","volume":"59","author":"Kanoria","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181174500_ref051","doi-asserted-by":"crossref","first-page":"3125","DOI":"10.1109\/TIT.2016.2555321","article-title":"Codes for DNA sequence profiles","volume":"62","author":"Kiah","year":"2016","journal-title":"IEEE Trans. on Information Theory"},{"key":"2026032712181174500_ref052","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/ISIT44484.2020.9174139","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Kiah","year":"2020"},{"key":"2026032712181174500_ref053","first-page":"1943","article-title":"Efficient bee identification","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Kiah","year":"2021"},{"issue":"11","key":"2026032712181174500_ref054","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1038\/s41587-019-0356-z","article-title":"A dna-of-things storage architecture to create materials with embedded memory","volume":"38","author":"Koch","year":"2020","journal-title":"Nature Biotechnology"},{"issue":"5","key":"2026032712181174500_ref055","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1038\/nmeth.2918","article-title":"Large-scale de novo DNA synthesis: Technologies and applications","volume":"11","author":"Kosuri","year":"2014","journal-title":"Nature methods"},{"key":"2026032712181174500_ref056","article-title":"Runlength-limited sequences and shift-correcting codes: Asymptotic analysis","volume-title":"IEEE Transactions on Information Theory","author":"Kova\u010devi\u0107","year":"2019"},{"issue":"11","key":"2026032712181174500_ref057","doi-asserted-by":"crossref","first-page":"2194","DOI":"10.1109\/LCOMM.2018.2868666","article-title":"Asymptotically optimal codes correcting fixed-length duplication errors in DNA storage systems","volume":"22","author":"Kova\u010devi\u0107","year":"2018","journal-title":"IEEE Communications Letters"},{"issue":"7","key":"2026032712181174500_ref058","doi-asserted-by":"crossref","first-page":"5156","DOI":"10.1109\/TIT.2017.2789292","article-title":"Codes in the space of multisets\u2014 coding for permutation channels with impairments","volume":"64","author":"Kova\u010devi\u0107","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712181174500_ref059","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","article-title":"Genomic mapping by fingerprinting random clones: A mathematical analysis","volume":"2","author":"Lander","year":"1988","journal-title":"Genomics"},{"issue":"1","key":"2026032712181174500_ref060","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TIT.2008.2008121","article-title":"On the capacity of the discretetime poisson channel","volume":"55","author":"Lapidoth","year":"2008","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712181174500_ref061","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1109\/TIT.2011.2134430","article-title":"The discrete-time poisson channel at low input powers","volume":"57","author":"Lapidoth","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"36","key":"2026032712181174500_ref062","doi-asserted-by":"crossref","first-page":"10722","DOI":"10.1002\/anie.201605279","article-title":"Coding in 2d: Using intentional dispersity to enhance the information capacity of sequence-coded polymer barcodes","volume":"55","author":"Laure","year":"2016","journal-title":"Angewandte Chemie International Edition"},{"issue":"1","key":"2026032712181174500_ref063","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1038\/s41467-019-10258-1","article-title":"Terminator-free template-independent enzymatic dna synthesis for digital information storage","volume":"10","author":"Lee","year":"2019","journal-title":"Nature Communications"},{"key":"2026032712181174500_ref064","first-page":"1","article-title":"Concatenated codes for recovery from multiple reads of dna sequences","volume-title":"IEEE Information Theory Workshop (ITW)","author":"Lenz","year":"2021"},{"key":"2026032712181174500_ref065","doi-asserted-by":"crossref","DOI":"10.1109\/ITW44776.2019.8989388","article-title":"An upper bound on the capacity of the DNA storage channel","volume-title":"IEEE Information Theory Workshop","author":"Lenz","year":"2019"},{"key":"2026032712181174500_ref066","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Lenz","year":"2019"},{"issue":"4","key":"2026032712181174500_ref067","doi-asserted-by":"crossref","first-page":"2331","DOI":"10.1109\/TIT.2019.2961265","article-title":"Coding over sets for dna storage","volume":"66","author":"Lenz","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref068","first-page":"8846","volume-title":"ICASSP 20202020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Lenz","year":"2020"},{"issue":"3","key":"2026032712181174500_ref069","first-page":"417","article-title":"Reconstruction of objects from a minimum number of distorted patterns","volume":"55","author":"Levenshtein","year":"1997","journal-title":"Doklady Mathematics"},{"key":"2026032712181174500_ref070","doi-asserted-by":"crossref","DOI":"10.1109\/CISS53076.2022.9751151","article-title":"Achieving the capacity of a dna storage channel with linear coding schemes","volume-title":"56th Annual Conference on Information Sciences and Systems (CISS), IEEE","author":"Levick","year":"2022"},{"issue":"6","key":"2026032712181174500_ref071","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1049\/ip-com:20050237","article-title":"Fountain codes","volume":"152","author":"MacKay","year":"2005","journal-title":"IEE Proceedings - Communications"},{"issue":"1","key":"2026032712181174500_ref072","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TMBMC.2016.2630056","article-title":"Fundamental bounds for sequence reconstruction from nanopore sequencers","volume":"2","author":"Magner","year":"2016","journal-title":"IEEE Transactions on Molecular, Biological and Multi-Scale Communications"},{"key":"2026032712181174500_ref073","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/ALLERTON.2018.8636070","volume-title":"2018 56th Annual Al lerton Conference on Communication, Control, and Computing (Allerton)","author":"Makur","year":"2018"},{"issue":"4","key":"2026032712181174500_ref074","doi-asserted-by":"crossref","first-page":"3216","DOI":"10.1109\/TIT.2018.2809001","article-title":"Models and informationtheoretic bounds for nanopore sequencing","volume":"64","author":"Mao","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712181174500_ref075","doi-asserted-by":"crossref","first-page":"4657","DOI":"10.1109\/TIT.2006.881844","article-title":"A simple lower bound for the capacity of the deletion channel","volume":"52","author":"Mitzenmacher","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref076","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/ISIT.2006.261874","volume-title":"2006 IEEE International Symposium on Information Theory","author":"Mitzenmacher","year":"2006"},{"issue":"10","key":"2026032712181174500_ref077","doi-asserted-by":"crossref","first-page":"6273","DOI":"10.1109\/TIT.2013.2270273","article-title":"Information theory of DNA shotgun sequencing","volume":"59","author":"Motahari","year":"2013","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref078","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1145\/3055399.3055494","article-title":"Trace reconstruction with exp (o(n1\/3)) samples","volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","author":"Nazarov","year":"2017"},{"issue":"1","key":"2026032712181174500_ref079","first-page":"3","article-title":"Some fundamental issues of microminiaturization","volume":"1","author":"Neiman","year":"1964","journal-title":"Radiotekhnika"},{"key":"2026032712181174500_ref080","doi-asserted-by":"crossref","DOI":"10.1038\/nbt.4079","article-title":"Random access in large-scale dna data storage","volume-title":"Nature Biotechnology","author":"Organick","year":"2018"},{"issue":"5","key":"2026032712181174500_ref081","doi-asserted-by":"crossref","first-page":"2001094","DOI":"10.1002\/smtd.202001094","article-title":"An empirical comparison of preservation methods for synthetic dna data storage","volume":"5","author":"Organick","year":"2021","journal-title":"Smal l Methods"},{"issue":"1","key":"2026032712181174500_ref082","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.bdq.2014.08.002","article-title":"A survey of tools for the analysis of quantitative pcr (qpcr) data","volume":"1","author":"Pabinger","year":"2014","journal-title":"Biomolecular Detection and Quantification"},{"key":"2026032712181174500_ref083","first-page":"1","volume-title":"2019 IEEE Information Theory Workshop (ITW)","author":"Pattabiraman","year":"2019"},{"key":"2026032712181174500_ref084","first-page":"1","volume-title":"Fungal Secondary Metabolism","author":"Pomraning","year":"2012"},{"key":"2026032712181174500_ref085","article-title":"Clustering billions of reads for dna data storage","volume":"30","author":"Rashtchian","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026032712181174500_ref086","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT45174.2021.9518272","article-title":"Capacity of the torn paper channel with lost pieces","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Ravi","year":"2021"},{"key":"2026032712181174500_ref087","doi-asserted-by":"crossref","DOI":"10.1101\/2021.04.20.440194","article-title":"Dna-based data storage via combinatorial assembly","volume-title":"bioRxiv","author":"Roquet","year":"2021"},{"issue":"5","key":"2026032712181174500_ref088","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1093\/bioinformatics\/btaa740","article-title":"Solqc: Synthetic oligo library quality control tool","volume":"37","author":"Sabary","year":"2021","journal-title":"Bioinformatics"},{"key":"2026032712181174500_ref089","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/ISIT44484.2020.9174488","article-title":"The error probability of maximum-likelihood decoding over two deletion\/insertion channels","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Sabary","year":"2020"},{"key":"2026032712181174500_ref090","doi-asserted-by":"crossref","DOI":"10.1101\/2020.09.16.300186","article-title":"Reconstruction algorithms for dna-storage systems","volume-title":"bioRxiv","author":"Sabary","year":"2020"},{"issue":"2","key":"2026032712181174500_ref091","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/scin.5591840203","article-title":"Story one: Ancient horse\u2019s DNA fills in picture of equine evolution: A 700,000-year-old fossil proves astoundingly well preserved","volume":"184","author":"Saey","year":"2013","journal-title":"Science News"},{"key":"2026032712181174500_ref092","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2017.2649493","article-title":"Exact reconstruction from insertions in synchronization codes","volume-title":"IEEE Transactions on Information Theory","author":"Sala","year":"2017"},{"key":"2026032712181174500_ref093","unstructured":"J.\n              Sayir\n            \n          , Lecture notes for advanced communications and coding: Binary linear codes over the erasure channel, 2014, URL: https:\/\/www-sigproc.eng.cam.ac.uk\/foswiki\/pub\/Main\/4F5\/cod1.pdf."},{"key":"2026032712181174500_ref094","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1186\/s12859-016-0976-y","article-title":"Illumina error profiles: Resolving fine-scale variation in metagenomic sequencing data","volume":"17","author":"Schirmer","year":"2016","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"2026032712181174500_ref095","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/18.179338","article-title":"Bounds on the capacity of a spectrally constrained poisson channel","volume":"39","author":"Shamai","year":"1993","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref096","first-page":"8841","volume-title":"ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Shin","year":"2020"},{"key":"2026032712181174500_ref097","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Shinkar","year":"2019"},{"issue":"6","key":"2026032712181174500_ref098","doi-asserted-by":"crossref","first-page":"3675","DOI":"10.1109\/TIT.2021.3058966","article-title":"Dna-based storage: Models and fundamental limits","volume":"67","author":"Shomorony","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref099","article-title":"Communicating over the tornpaper channel","volume-title":"IEEE Global Communications Conference (IEEE GLOBECOM)","author":"Shomorony","year":"2021"},{"issue":"6","key":"2026032712181174500_ref100","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1109\/TIT.2020.3028702","article-title":"On optimal k-deletion correcting codes","volume":"67","author":"Sima","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref101","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/ISIT.2019.8849596","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Sima","year":"2019"},{"key":"2026032712181174500_ref102","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/ISIT44484.2020.9174447","article-title":"Robust indexing - optimal codes for dna storage","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Sima","year":"2020"},{"issue":"1010","key":"2026032712181174500_ref103","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1038\/13664","article-title":"Maskless fabrication of light- directed oligonucleotide microarrays using a digital micromirror array","volume":"17","author":"Singh-Gasson","year":"1999","journal-title":"Nature Biotechnology"},{"issue":"10","key":"2026032712181174500_ref104","doi-asserted-by":"crossref","first-page":"6048","DOI":"10.1109\/TIT.2020.3002611","article-title":"Sequence-subset distance and coding for error control in dna-based data storage","volume":"66","author":"Song","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"2026032712181174500_ref105","doi-asserted-by":"crossref","first-page":"6048","DOI":"10.1109\/TIT.2020.3002611","article-title":"Sequencesubset distance and coding for error control in dna-based data storage","volume":"66","author":"Song","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712181174500_ref106","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/ISIT.2019.8849567","volume-title":"2019 IEEE International Symposium on Information Theory (ISIT)","author":"Srinivasavaradhan","year":"2019"},{"key":"2026032712181174500_ref107","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/ISIT.2018.8437519","volume-title":"2018 IEEE International Symposium on Information Theory (ISIT)","author":"Srinivasavaradhan","year":"2018"},{"key":"2026032712181174500_ref108","volume-title":"Trellis bma: Coded trace reconstruction on ids channels for dna storage","author":"Srinivasavaradhan","year":"2021"},{"issue":"1","key":"2026032712181174500_ref109","doi-asserted-by":"crossref","first-page":"1742","DOI":"10.1038\/s41467-020-15588-z","article-title":"Dna punch cards for storing data on native dna sequences via enzymatic nicking","volume":"11","author":"Tabatabaei","year":"2020","journal-title":"Nature Communications"},{"key":"2026032712181174500_ref110","volume-title":"Error exponents in the bee identification problem","author":"Tamir","year":"2020"},{"key":"2026032712181174500_ref111","doi-asserted-by":"crossref","DOI":"10.1109\/TCOMM.2019.2935204","article-title":"The bee-identification problem: Bounds on the error exponent","volume-title":"IEEE Transactions on Communications","author":"Tandon","year":"2019"},{"issue":"12","key":"2026032712181174500_ref112","doi-asserted-by":"crossref","first-page":"7602","DOI":"10.1109\/TIT.2020.3019387","article-title":"The bee-identification error exponent with absentee bees","volume":"66","author":"Tandon","year":"2020","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7849","key":"2026032712181174500_ref113","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1038\/s41586-021-03224-9","article-title":"Million-year-old dna sheds light on the genomic history of mammoths","volume":"591","author":"van der Valk","year":"2021","journal-title":"Nature"},{"key":"2026032712181174500_ref114","article-title":"Poisson communication theory","volume":"66","author":"Verd\u00fa","year":"1999","journal-title":"International Tech- nion Communication Day in Honor of Israel Bar-David"},{"key":"2026032712181174500_ref115","first-page":"1","volume-title":"Improved coding over sets for dna- based data storage","author":"Wei","year":"2021"},{"key":"2026032712181174500_ref116","volume-title":"The DNA storage channel: Capacity and error probability","author":"Weinberger","year":"2021"},{"key":"2026032712181174500_ref117","doi-asserted-by":"crossref","DOI":"10.12688\/f1000research.10571.2","article-title":"Comprehensive comparison of pacific biosciences and oxford nanopore technologies and their applications to transcriptome analysis","volume":"6","author":"Weirather","year":"2017","journal-title":"F1000Research"},{"issue":"7","key":"2026032712181174500_ref118","doi-asserted-by":"crossref","first-page":"e0131701","DOI":"10.1371\/journal.pone.0131701","article-title":"A rapid and low-cost pcr thermal cycler for low resource settings","volume":"10","author":"Wong","year":"2015","journal-title":"PLoS one"},{"key":"2026032712181174500_ref119","article-title":"A rewritable, random-access DNA-based storage system","volume":"5","author":"Yazdi","year":"2015","journal-title":"Scientific Reports"},{"issue":"1","key":"2026032712181174500_ref120","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error- free DNA-based data storage","volume":"7","author":"Yazdi","year":"2017","journal-title":"Scientific Reports"},{"issue":"3","key":"2026032712181174500_ref121","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1038\/s41589-020-00711-4","article-title":"Robust direct digital-to-biological data storage in living cells","volume":"17","author":"Yim","year":"2021","journal-title":"Nature Chemical Biology"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/19\/1\/1\/11146923\/0100000117en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/19\/1\/1\/11146923\/0100000117en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:33Z","timestamp":1777471833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/19\/1\/1\/1332140\/Information-Theoretic-Foundations-of-DNA-Data"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,24]]},"references-count":121,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,24]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000117","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,24]]}}}