Information-Theoretic Foundations of DNA Data Storage
Open accessAbstract
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. 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. 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.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The inner-outer coding scheme cannot correct large error rates dominated by insertions and deletions because no inner codes exist that work sufficiently well on short sequences in these noisy setups.
“However, it cannot correct large error rates that are dominated by insertions and deletions. This is because no inner codes exist that work sufficiently well on short sequences in these noisy setups.92”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [92]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
MUSCLE: multiple sequence alignment with high accuracy and high throughput
Edgar, R. C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh340 · Cited by 44,662 · see citing works
Quality-filtering vastly improves diversity estimates from Illumina amplicon sequencing
Bokulich, N. A., Subramanian, S., Faith, J. J., Gevers, D., Gordon, J. I., Knight, R. D., Mills, D. A., & Caporaso, J. G. (2012) · Nature Methods · doi:10.1038/nmeth.2276 · Cited by 4,406 · see citing works
Next-Generation Digital Information Storage in DNA
Church, G. M., Gao, Y., & Kosuri, S. (2012) · Science · doi:10.1126/science.1226355 · Cited by 1,441 · see citing works
Towards Practical, High-Capacity, Low-Maintenance Information Storage in Synthesized DNA
Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E. M., Sipos, B., & Birney, E. (2013) · Nature · doi:10.1038/nature11875 · Cited by 1,220 · see citing works
The Third Revolution in Sequencing Technology
van Dijk, E., Jaszczyszyn, Y., Naquin, D., & Thermes, C. (2018) · Trends in Genetics · doi:10.1016/j.tig.2018.05.008 · Cited by 1,186 · see citing works
Analyzing and minimizing PCR amplification bias in Illumina sequencing libraries
Aird, D., Ross, M. G., Chen, W.-S., Danielsson, M., Fennell, T., Russ, C., Jaffe, D. B., Nusbaum, C., & Gnirke, A. (2011) · Genome Biology · doi:10.1186/gb-2011-12-2-r18 · Cited by 1,174 · see citing works
Genomic mapping by fingerprinting random clones: A mathematical analysis
Lander, E. S., & Waterman, M. S. (1988) · Genomics · doi:10.1016/0888-7543(88)90007-9 · Cited by 942 · see citing works
Mackay, D. (2005) · IEE Proceedings - Communications · doi:10.1049/ip-com:20050237 · Cited by 900 · see citing works
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898 · see citing works
Large-scale de novo DNA synthesis: technologies and applications
Kosuri, S., & Church, G. M. (2014) · Nature Methods · doi:10.1038/nmeth.2918 · Cited by 869 · see citing works
Random access in large-scale DNA data storage
Organick, L., Ang, S. D., Chen, Y.-J., Lopez, R., Yekhanin, S., Makarychev, K., Racz, M. Z., Kamath, G., Gopalan, P., Nguyen, B., et al. (2018) · Nature Biotechnology · doi:10.1038/nbt.4079 · Cited by 775 · see citing works
Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754 · see citing works
Self-citationMaskless fabrication of light-directed oligonucleotide microarrays using a digital micromirror array
Singh‐Gasson, S., Green, R. D., Yue, Y., Nelson, C. J., Blattner, F. R., Sussman, M. R., & Cerrina, F. (1999) · Nature Biotechnology · doi:10.1038/13664 · Cited by 733 · see citing works
Weirather, J. L., de Cesare, M., Wang, Y., Piazza, P., Sebastiano, V., Wang, X., Buck, D., & Au, K. F. (2017) · F1000Research · doi:10.12688/f1000research.10571.2 · Cited by 483 · see citing works
Illumina error profiles: resolving fine-scale variation in metagenomic sequencing data
Schirmer, M., D’Amore, R., Ijaz, U. Z., Hall, N., & Quince, C. (2016) · BMC Bioinformatics · doi:10.1186/s12859-016-0976-y · Cited by 376 · see citing works
Portable and Error-Free DNA-Based Data Storage
Yazdi, S. M. H. T., Gabrys, R., & Milenkovic, O. (2017) · Scientific Reports · doi:10.1038/s41598-017-05188-1 · Cited by 361 · see citing works
Million-year-old DNA sheds light on the genomic history of mammoths
van der Valk, T., Pečnerová, P., Díez-del-Molino, D., Bergström, A., Oppenheimer, J., Hartmann, S., Xenikoudakis, G., Thomas, J. A., Dehasque, M., Sağlıcan, E., et al. (2021) · Nature · doi:10.1038/s41586-021-03224-9 · Cited by 345 · see citing works
Enzymatic DNA synthesis for digital information storage.
Lee, H. H., Kalhor, R., Goela, N., Bolot, J., & Church, G. M. (2018) · doi:10.1101/348987 · Cited by 265 · see citing works
Data storage in DNA with fewer synthesis cycles using composite DNA letters.
Anavy, L., Vaknin, I., Atar, O., Amit, R., & Yakhini, Z. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0240-x · Cited by 229 · see citing works
A survey of tools for the analysis of quantitative PCR (qPCR) data
Pabinger, S., Rödiger, S., Kriegner, A., Vierlinger, K., & Weinhäusel, A. (2014) · Biomolecular Detection and Quantification · doi:10.1016/j.bdq.2014.08.002 · Cited by 189 · see citing works
A DNA-of-things storage architecture to create materials with embedded memory.
Koch, J., Gantenbein, S., Masania, K., Stark, W. J., Erlich, Y., & Grass, R. N. (2020) · Nature Biotechnology · doi:10.1038/s41587-019-0356-z · Cited by 183 · see citing works
Antkowiak, P. L., Lietard, J., Darestani, M. Z., Somoza, M. M., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Communications · doi:10.1038/s41467-020-19148-3 · Cited by 173 · see citing works
Self-citationBuilding an Associative Memory Vastly Larger Than the Brain
Baum, E. B. (1995) · Science · doi:10.1126/science.7725109 · Cited by 169 · see citing works
On the Capacity of the Discrete-Time Poisson Channel
Lapidoth, A., & Moser, S. M. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2008121 · Cited by 155 · see citing works
Efficient Low-Redundancy Codes for Correcting Multiple Deletions
Brakensiek, J., Guruswami, V., & Zbarsky, S. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2746566 · Cited by 138 · see citing works
Codes for DNA Sequence Profiles
Kiah, H. M., Puleo, G. J., & Milenković, O. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555321 · Cited by 121 · see citing works
DNA punch cards for storing data on native DNA sequences via enzymatic nicking
Tabatabaei, S. K., Wang, B., Athreya, N. B. M., Enghiad, B., Hernandez, A. G., Fields, C. J., Leburton, J.-P., Soloveichik, D., Zhao, H., & Milenkovic, O. (2020) · Nature Communications · doi:10.1038/s41467-020-15588-z · Cited by 120 · see citing works
Information Theory of DNA Shotgun Sequencing
Motahari, S. A., Bresler, G., & Tse, D. N. C. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2270273 · Cited by 113 · see citing works
Quantifying Molecular Bias in DNA Data Storage
Chen, Y.-J., Takahashi, C. N., Organick, L., Stewart, K., Ang, S. D., Weiss, P., Peck, B., Seelig, G., Ceze, L., & Strauss, K. (2019) · doi:10.1101/566554 · Cited by 109 · see citing works
Exact Reconstruction From Insertions in Synchronization Codes
Sala, F., Gabrys, R., Schoeny, C., & Dolecek, L. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2649493 · Cited by 93 · see citing works
Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
Kovačević, M., & Tan, V. Y. F. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2789292 · Cited by 91 · see citing works
Cheraghchi, M., Gabrys, R., Milenkovic, O., & Ribeiro, J. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2996377 · Cited by 90 · see citing works
Laure, C., Karamessini, D., Milenković, O., Charles, L., & Lutz, J. (2016) · Angewandte Chemie International Edition · doi:10.1002/anie.201605279 · Cited by 87 · see citing works
Robust direct digital-to-biological data storage in living cells.
Yim, S. S., McBee, R. M., Song, A. M., Huang, Y., Sheth, R. U., & Wang, H. H. (2021) · Nature Chemical Biology · doi:10.1038/s41589-020-00711-4 · Cited by 83 · see citing works
On Optimal k-Deletion Correcting Codes
Sima, J., & Bruck, J. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3028702 · Cited by 81 · see citing works
A brief review of DNA and RNA chemical synthesis
Caruthers, M. H. (2011) · Biochemical Society Transactions · doi:10.1042/bst0390575 · Cited by 79 · see citing works
A Rapid and Low-Cost PCR Thermal Cycler for Low Resource Settings
Wong, G., Wong, I., Chan, K., et al. (2015) · PLoS ONE · doi:10.1371/journal.pone.0131701 · Cited by 74 · see citing works
A Simple Lower Bound for the Capacity of the Deletion Channel
Mitzenmacher, M., & Drinea, E. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881844 · Cited by 72 · see citing works
DNA-Based Storage: Models and Fundamental Limits
Shomorony, I., & Heckel, R. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3058966 · Cited by 68 · see citing works
Self-citationAn Empirical Comparison of Preservation Methods for Synthetic DNA Data Storage
Organick, L., Nguyen, B. H., McAmis, R., Chen, W. D., Kohll, A. X., Ang, S. D., Grass, R. N., Ceze, L., & Strauss, K. (2021) · Small Methods · doi:10.1002/smtd.202001094 · Cited by 67 · see citing works
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound
Guruswami, V., & Håstad, J. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3069446 · Cited by 65 · see citing works
Asymptotically Optimal Codes Correcting Fixed-Length Duplication Errors in DNA Storage Systems
Kovačević, M., & Tan, V. Y. F. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2868666 · Cited by 63 · see citing works
The Discrete-Time Poisson Channel at Low Input Powers
Lapidoth, A., Shapiro, J. H., Venkatesan, V., et al. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2134430 · Cited by 61 · see citing works
Bounds on the capacity of a spectrally constrained Poisson channel
Shamai, S. S., & Lapidoth, A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.179338 · Cited by 61 · see citing works
Trace reconstruction with exp(O(n 1/3 )) samples
Nazarov, F., & Peres, Y. (2017) · ACM SIGACT Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055494 · Cited by 58 · see citing works
String Reconstruction from Substring Compositions
Acharya, J., Das, H., Milenković, O., et al. (2015) · SIAM Journal on Discrete Mathematics · doi:10.1137/140962486 · Cited by 55 · see citing works
Sequence Reconstruction Over the Deletion Channel
Gabrys, R., & Yaakobi, E. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2800044 · Cited by 55 · see citing works
Optimal coding strategies for certain permuting channels
Ahlswede, R., & Kaspi, A. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057313 · Cited by 54 · see citing works
Models and Information-Theoretic Bounds for Nanopore Sequencing
Mao, W., Diggavi, S. N., & Kannan, S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2809001 · Cited by 52 · see citing works
Optimal Coding for the Binary Deletion Channel With Small Deletion Probability
Kanoria, Y., & Andrea Montanari, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2262020 · Cited by 46 · see citing works
Optimal mean-based algorithms for trace reconstruction
De, A., O’Donnell, R., & Servedio, R. A. (2017) · ACM SIGACT Symposium on Theory of Computing (STOC) · doi:10.1145/3055399.3055450 · Cited by 46 · see citing works
Synchronization Strings and Codes for Insertions and Deletions—A Survey
Haeupler, B., & Shahrasbi, A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3056317 · Cited by 40 · see citing works
An Upper Bound on the Capacity of the DNA Storage Channel
Lenz, A., Siegel, P. H., Wachter-Zeh, A., & Yaakobi, E. (2019) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw44776.2019.8989388 · Cited by 37 · see citing works
SOLQC: Synthetic Oligo Library Quality Control tool
Sabary, O., Orlev, Y., Shafir, R., Anavy, L., Yaakobi, E., & Zohar Yakhini, B. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa740 · Cited by 34 · see citing works
Coding for Deletion Channels with Multiple Traces
Abroshan, M., Venkataramanan, R., Dolecek, L., & Fàbregas, A. G. I. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849647 · Cited by 31 · see citing works
Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage
Song, W., Cai, K., & Immink, K. A. S. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3002611 · Cited by 31 · see citing works
On Maximum Likelihood Reconstruction over Multiple Deletion Channels
Srinivasavaradhan, S. R., Du, M., Diggavi, S. N., & Fragouli, C. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437519 · Cited by 30 · see citing works
Trace reconstruction with varying deletion probabilities
Hartung, L., Holden, N., & Peres, Y. (2018) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975062.6 · Cited by 27 · see citing works
Capacity Upper Bounds for Deletion-type Channels
Cheraghchi, M. (2019) · Journal of the ACM · doi:10.1145/3281275 · Cited by 24 · see citing works
On the Theory and Practice of Data Recovery with Multiple Versions
Mitzenmacher, M. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261874 · Cited by 24 · see citing works
DNA-based data storage via combinatorial assemblyPreprint
Roquet, N., Bhatia, S. P., Flickinger, S. A., Mihm, S., Norsworthy, M. W., Leake, D., & Park, H. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.04.20.440194 · Cited by 24 · see citing works
On Coding Over Sliced Information
Sima, J., Raviv, N., & Bruck, J. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849596 · Cited by 23 · see citing works
Fundamental Bounds for Sequence Reconstruction From Nanopore Sequencers
Magner, A., Duda, J., Wojciech Szpankowski, A., & Grama, A. Y. (2016) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2016.2630056 · Cited by 21 · see citing works
Capacity of the Torn Paper Channel with Lost Pieces
Ravi, A. N., Vahid, A., & Shomorony, I. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518272 · Cited by 21 · see citing works
Self-citationCoding for Sequence Reconstruction for Single Edits
Kiah, H. M., Nguyen, T. T., & Yaakobi, E. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174139 · Cited by 19 · see citing works
Efficient Linear and Affine Codes for Correcting Insertions/Deletions
Cheng, K., Guruswami, V., Haeupler, B., et al. (2021) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976465.1 · Cited by 19 · see citing works
The Bee-Identification Problem: Bounds on the Error Exponent
Tandon, A., Tan, V. Y. F., & Varshney, L. R. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2935204 · Cited by 18 · see citing works
Reconstruction Algorithms for DNA-Storage SystemsPreprint
Sabary, O., Yucovich, A., Shapira, G., & Yaakobi, E. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.09.16.300186 · Cited by 18 · see citing works
Mass Error-Correction Codes for Polymer-Based Data Storage
Gabrys, R., Pattabiraman, S., & Milenković, O. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174404 · Cited by 16 · see citing works
Asymmetric Lee distance codes: New bounds and constructions
Gabrys, R., Kiah, H. M., & Milenković, O. (2015) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2015.7133171 · Cited by 15 · see citing works
Robust Indexing - Optimal Codes for DNA Storage
Sima, J., Raviv, N., & Bruck, J. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174447 · Cited by 15 · see citing works
Symbolwise MAP for Multiple Deletion Channels
Srinivasavaradhan, S. R., Du, M., Diggavi, S. N., & Fragouli, C. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849567 · Cited by 14 · see citing works
Information Capacity of BSC and BEC Permutation Channels
Makur, A. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636070 · Cited by 13 · see citing works
Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage
Chee, Y. M., Kiah, H. M., & Nguyen, T. T. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849643 · Cited by 11 · see citing works
The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels
Sabary, O., Yaakobi, E., & Yucovich, A. (2020) · 2020 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174488 · Cited by 10 · see citing works
A Characterization of the DNA Data Storage Channel
Heckel, R., Mikutis, G., & Grass, R. N. (2019) · Scientific Reports · doi:10.1038/s41598-019-45832-6 · Cited by 9 · see citing works
Self-citationThe DNA Storage Channel: Capacity and Error ProbabilityPreprint
Weinberger, N., & Merhav, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.12549 · Cited by 8 · see citing works
Efficient and Explicit Balanced Primer Codes
Chee, Y. M., Kiah, H. M., & Wei, H. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849437 · Cited by 7 · see citing works
Achieving the Capacity of a DNA Storage Channel with Linear Coding Schemes
Levick, K., Heckel, R., & Shomorony, I. (2022) · Conference on Information Sciences and Systems · doi:10.1109/ciss53076.2022.9751151 · Cited by 7 · see citing works
Self-citationSaey, T. H. (2013) · Science News · doi:10.1002/scin.5591840203 · Cited by 1 · see citing works
Error Exponents in the Bee Identification ProblemPreprint
Tamir, R., & Merhav, N. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.09799
Achieving the Capacity of a DNA Storage Channel with Linear Coding SchemesPreprint
Levick, K., Heckel, R., & Shomorony, I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.01630
Self-citationReed Solomon Codes Against Adversarial Insertions and DeletionsPreprint
Con, R., Shpilka, A., & Tamo, I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.05699
Sharp analytical capacity upper bounds for sticky and related channels
Cheraghchi (2019) · doi:10.1109/tit.2019.2920375
UnresolvedCodes correcting two deletions
Gabrys (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2876281
UnresolvedCoding over sets for dna storage
Lenz (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2961265
UnresolvedThe bee-identification error exponent with absentee bees
Tandon (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3019387
UnresolvedGlass: A new media for a new era?
Anderson (2018)
UnresolvedReconstructing strings from random traces
Batu (2004)
UnresolvedCoding for a Noisy Channel with Permutation Errors
Benjamin (1975)
UnresolvedTrace reconstruction problems in computational biology
Bhardwaj (2020)
UnresolvedProcedia Computer Science, International Conference on Computational Science 2016, ICCS 2016, 6-8 June 2016
Blawat (2016)
UnresolvedProc. of ASPLOS
Bornholt (2016)
Unresolved2019 57th Annual Al lerton Conference on Communication, Control, and Computing (Al lerton)
Chandak (2019)
UnresolvedAnnales de l’Institut Henri Poincaré, Probabilités et Statistiques
Chase (2021)
Unresolved2020 International Symposium on Information Theory and Its Applications (ISITA)
Chrisnata (2020)
UnresolvedLinear and reed solomon codes against adversarial insertions and deletions
Con (2021)
UnresolvedCoding for two noisy channels
Elias (1955)
UnresolvedRepeated deletion channels
Haeupler (2014)
UnresolvedSynchronization strings: Codes for insertions and deletions approaching the singleton bound
Haeupler (2017)
UnresolvedScalable techniques for clustering the web
Haveliwala (2000)
UnresolvedR. Heckel and R.Grass, Instructions to encode the first Biohackers episode from DNA, Mar. 2021, URL: https://github.com/reinhardh/dna_rs_coding.
(n.d.)
UnresolvedSubpolynomial trace reconstruction for random strings and arbitrary deletion probability
Holden (2018)
UnresolvedProceedings of the nineteenth annual ACM- SIAM symposium on Discrete algorithms
Holenstein (2008)
UnresolvedEfficient bee identification
Kiah (2021)
UnresolvedRunlength-limited sequences and shift-correcting codes: Asymptotic analysis
Kovačević (2019)
UnresolvedConcatenated codes for recovery from multiple reads of dna sequences
Lenz (2021)
Unresolved2019 IEEE International Symposium on Information Theory (ISIT)
Lenz (2019)
UnresolvedICASSP 20202020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Lenz (2020)
UnresolvedReconstruction of objects from a minimum number of distorted patterns
Levenshtein (1997) · Doklady Mathematics
UnresolvedSome fundamental issues of microminiaturization
Neiman (1964) · Radiotekhnika
Unresolved2019 IEEE Information Theory Workshop (ITW)
Pattabiraman (2019)
UnresolvedFungal Secondary Metabolism
Pomraning (2012)
UnresolvedClustering billions of reads for dna data storage
Rashtchian (2017) · Advances in Neural Information Processing Systems
UnresolvedJ. Sayir , 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.
(n.d.)
UnresolvedICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Shin (2020)
Unresolved2019 IEEE International Symposium on Information Theory (ISIT)
Shinkar (2019)
UnresolvedCommunicating over the tornpaper channel
Shomorony (2021)
UnresolvedTrellis bma: Coded trace reconstruction on ids channels for dna storage
Srinivasavaradhan (2021)
UnresolvedError exponents in the bee identification problem
Tamir (2020)
UnresolvedPoisson communication theory
Verdú (1999) · International Tech- nion Communication Day in Honor of Israel Bar-David
UnresolvedImproved coding over sets for dna- based data storage
Wei (2021)
UnresolvedThe DNA storage channel: Capacity and error probability
Weinberger (2021)
UnresolvedA rewritable, random-access DNA-based storage system
Yazdi (2015) · Scientific Reports
Unresolved
Flagged first, then by citations
41 of the 121 references couldn’t be matched to a known paper.
Research works printed but not linked: 1
- Song, 2020, Sequencesubset distance and coding for error control in dna-based data storage, IEEE Transactions on Information Theory, 66, 6048, 10.1109/tit.2020.3002611 · DOI
Cited by
Sorted by citations
Emerging Approaches to DNA Data Storage: Challenges and Prospects
Doricchi, A., Platnich, C. M., Gimpel, A., Horn, F., Earle, M., Lanzavecchia, G., Cortajarena, A. L., Liz-Marzán, L. M., Liu, N., Heckel, R., et al. (2022) · ACS Nano · doi:10.1021/acsnano.2c06748 · Cited by 235 · see citing works
Self-citationSurvey for a Decade of Coding for DNA Storage
Sabary, O., Kiah, H. M., Siegel, P. H., & Yaakobi, E. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3403488 · Cited by 33 · see citing works
“(see [58], [59] and the references therein), while the code design problem is referred to as coding over sets [60].”
BackgroundSequencing Coverage Analysis for Combinatorial DNA-Based Storage Systems
Preuss, I., Galili, B., Zohar Yakhini, B., & Anavy, L. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3408053 · Cited by 31 · see citing works
“While DNA-based storage stands as a promising technology and the cost of DNA sequencing is decreasing, it remains significantly more expensive than reading from established archival storage solutions [9], [10], [11], [12].”
BackgroundDNA-Based Data Storage Systems: A Review of Implementations and Code Constructions
Milenković, O., & Pan, C. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3367748 · Cited by 27 · see citing works
“For a summary of relevant concepts and terminology in synthetic and molecular biology, the interested reader is also referred to the earlier review [126] and the more recent monograph [105].”
BackgroundDeletion Correcting Codes for Efficient DNA Synthesis
Chrisnata, J., Kiah, H. M., & Pham, V. L. P. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206892 · Cited by 15 · see citing works
“1 in [3] for experiments for DNA data storage).”
BackgroundCover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Bar-Lev, D., Sabary, O., Gabrys, R., & Yaakobi, E. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206882 · Cited by 15 · see citing works
Covering All Bases: The Next Inning in DNA Sequencing Efficiency
Abraham, H., Gabrys, R., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619092 · Cited by 15 · see citing works
“Despite the potential of DNA storage, current DNA sequencers face challenges such as slow throughput and high costs compared to alternatives [7], [8], [9].”
BackgroundAn Information-Theoretic Approach to Nanopore Sequencing for DNA Storage
McBain, B., & Viterbo, E. (2023) · IEEE BITS the Information Theory Magazine · doi:10.1109/mbits.2024.3355883 · Cited by 15 · see citing works
“The information-theoretic limits of variations of this channel model have been studied in recent years [5], [6], [7], and simultaneously codes to approach these limits have been proposed (e.g., [8], [9], [10], [11] [12], [13]).”
BackgroundInnovation in Constrained Codes
Immink, K. A. S. (2022) · IEEE Communications Magazine · doi:10.1109/mcom.002.2200249 · Cited by 14 · see citing works
Error Correction for DNA Storage
Sima, J., Raviv, N., Schwartz, M., & Bruck, J. (2023) · IEEE BITS the Information Theory Magazine · doi:10.1109/mbits.2023.3318516 · Cited by 14 · see citing works
“We also refer to [28], [88], [119] for a broader overview of different aspects in DNA storage.”
BackgroundOptimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions
Con, R., Shpilka, A., & Tamo, I. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3387848 · Cited by 11 · see citing works
“Further, codes for correcting insdel errors attract a lot of attention due to their possible application in correcting errors in DNA-based storage systems [19], [21], [28].”
BackgroundDeep Learning-Based Detection for Marker Codes Over Insertion and Deletion Channels
Ma, G., Jiao, X., Mu, J., Han, H., & Yang, Y. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3394039 · Cited by 12 · see citing works
“C HANNELS with synchronization errors [1], including insertions and deletions, have appeared in various communication and storage systems, such as wireless communication [2], [3], racetrack memory [4], and DNA storage [5].”
BackgroundCover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Bar-Lev, D., Sabary, O., Gabrys, R., & Yaakobi, E. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3496587 · Cited by 11 · see citing works
“Nowadays, DNA sequencers suffer from relatively slow throughput as well as high costs relative to other alternative storage technologies [18], [23], [24].”
Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel
Maarouf, I., Rosnes, E., & Amat, A. G. I. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10161642 · Cited by 10 · see citing works
“For the inner code we use the (1, 1, 2)4 convolutional code with generator polynomial g = [5, 7]OCT and punctured in order to have a higher rate.”
MethodA Combinatorial Perspective on Random Access Efficiency for DNA Storage
Gruica, A., Bar-Lev, D., Ravagnani, A., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619151 · Cited by 12 · see citing works
“While several works demonstrated the potential of DNA as a storage medium [4]–[10], the efficiency of DNA sequencers remains a bottleneck, with slow throughput and high costs compared to alternative storage technologies [2], [11], [12].”
Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel
Welter, L., Maarouf, I., Lenz, A., Wachter-Zeh, A., Rosnes, E., & Amat, A. G. I. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10161631 · Cited by 9 · see citing works
Weindel, F., Gimpel, A. L., Grass, R. N., & Heckel, R. (2023) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton58177.2023.10313494 · Cited by 10 · see citing works
“6% [40].”
Self-citationAn Information Theory for Out-of-Order Media With Applications in DNA Data Storage
Ravi, A. N., Vahid, A., & Shomorony, I. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3403759 · Cited by 7 · see citing works
“This channel has been the topic of several papers in information theory whose goal is to characterize their channel capacity, optimal coding schemes, and error exponents [7], [13], [14], [15].”
BackgroundSelf-citationRobust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions
Sima, J., Raviv, N., & Bruck, J. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3513040 · Cited by 7 · see citing works
“See [24] for a broader survey of the related problems.”
Lu, Z., Kiah, H. M., Zhang, Y., Grass, R. N., & Yaakobit, E. (2024) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw61385.2024.10806998 · Cited by 6 · see citing works
“Storing digital information on synthetic DNA strands has attracted significant interest due to its potential for information storage, particularly its durability and high storage density (see [1], [2] and references therein).”
InfluentialOn Achievable Rates for the Shotgun Sequencing Channel with Erasures
Narayanan, H., Krishnan, P., & Parekh, N. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619286 · Cited by 5 · see citing works
“Considering the availability of quality scores (see, for instance, [8]) for the base calls made by the sequencer, recent works have considered DNA storage channels with erasures (for instance, [9], [10]), in which erasures are used to model low quality base calls.”
BackgroundThe Coverage Depth Problem in Dna Storage Over Small Alphabets
Bertuzzo, M., Ravagnani, A., & Yaakobi, E. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195425 · Cited by 4 · see citing works
“Although DNA has high potential as a storage medium [4]– [10], the slow throughput and high costs compared to alternative storage techniques, resulting from the efficiency of DNA sequencers, represent a drawback [2], [11], [12].”
Advances and challenges in non-canonical nucleic acids data storage
Wang, Y., Pei, Y., Tang, L., Sun, X., Zhou, S., & Song, J. (2026) · Nature Communications · doi:10.1038/s41467-026-68708-6 · Cited by 4 · see citing works
“This signi fi cantly prolongs their lifespan in biological environments 191 , making them ideal for secure storage.”
From Biological Gene to Functional Gene: Revolutionizing Product Innovation Design
Zhang, P., Ren, Z., Zhang, C., Wang, H., & Nie, Z. (2023) · Applied Sciences · doi:10.3390/app14010199 · Cited by 5 · see citing works
Bee Identification Problem for DNA Strands
Chrisnata, J., Kiah, H. M., Vardy, A., & Yaakobi, E. (2023) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3294423 · Cited by 4 · see citing works
“Since the first experiments conducted by Church et al. in 2012 [4] and Goldman et al. in 2013 [5], there have been a flurry of experimental demonstrations (see [6], [7], [8] for a survey).”
BackgroundData-Driven Bee Identification for DNA Strands
Singhvi, S., Boruchovsky, A., Kiah, H. M., & Yaakobi, E. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206637 · Cited by 3 · see citing works
“Since the first experiments conducted by Church et al. in 2012 [4] and Goldman et al. in 2013 [5], there have been a flurry of experimental demonstrations (see [11], [13] for a survey).”
BackgroundMethodInformation Rates Over Multi-View Channels
Rameshwar, V. A., & Weinberger, N. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3518760 · Cited by 4 · see citing works
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Gruica, A., Bar-Lev, D., Ravagnani, A., & Yaakobi, E. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3623202 · Cited by 3 · see citing works
“While several works demonstrated the potential of DNA as a storage medium [4], [5], [6], [7], [8], [9], [10], the e ffi ciency of DNA sequencers remains a bottleneck, with slow throughput and high costs compared to alternative storage technologies [2], [11], [12].”
The Random Variables of the DNA Coverage Depth Problem
Bodur, Ş., Lia, S., López, H. H., Ludhani, R., Ravagnani, A., & Seccia, L. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3711141 · Cited by 3 · see citing works
“DNA o ff ers significant advantages over traditional storage media [11], [12], due to its density, durability, and sustainability.”
Capacity of Frequency-Based Channels: Encoding Information in Molecular Concentrations
Gerzon, Y., Shomorony, I., & Weinberger, N. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3578504 · Cited by 3 · see citing works
“In [14, Sec.”
InfluentialSelf-citationHuang, C., Li, R., & Li, A. (2024) · Mobile Networks and Applications · doi:10.1007/s11036-023-02208-5 · Cited by 3 · see citing works
“In order to achieve these goals and enhance the competitiveness of enterprises, the advanced data storage and output technologies must be fully utilized [4, 5].”
Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth
Dao, D. T., Kiah, H. M., & Nguyen, T. T. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3351991 · Cited by 3 · see citing works
“In recent years, interest in balanced codes has been rekindled because of the emergence of DNA macromolecules as a next-generation data storage medium with its unprecedented density, durability, and replication efficiency [2], [3].”
BackgroundCapacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage
Palunčić, F., Palunčić, D., & Maharaj, B. T. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619166 · Cited by 3 · see citing works
“As with magnetic and optical storage media, coding and information theory can provide a critical contribution [3].”
BackgroundThe Lattice-Input Discrete-Time Poisson Channel
Bello, F., Martin, Á., Rischewski, T., et al. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619495 · Cited by 3 · see citing works
“As a motivating example, consider the error-free shuffling sampling channel proposed in the DNA data storage literature [12].”
BackgroundIdentification via Binary Uniform Permutation Channel
Sarkar, A., & Dey, B. K. (2024) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw61385.2024.10806905 · Cited by 3 · see citing works
“Coding for DNA storage was studied in [24], [23], [22].”
On Achievable Rates Over Noisy Nanopore Channels
Rameshwar, V. A., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3598773 · Cited by 3 · see citing works
“In this light, various works, for example [7], [8], [9] considered the fundamental information-theoretic limits of a channel model for DNA-based storage, which takes into account processes such as Polymerase Chain Reaction (PCR) amplification, random sampling from a pool of DNA strands, and…”
Efficient Nested Hash Reassembly Codes for Torn Paper Channels
Jiao, X., Jiao, B., Mu, J., & Han, H. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3582709 · Cited by 2 · see citing works
“A general channel model, called noisy shuffling-sampling channel [13], is used to model these characteristics of DNA storage.”
On the Reliability of Information Retrieval from MDS Coded Data in DNA Storage
Hanna, S. K. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195362 · Cited by 2 · see citing works
“However, realizing efficient DNA storage systems requires addressing a variety of challenges, with reliability being a key concern [5], [6].”
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations
Gerzon, Y., Shomorony, I., & Weinberger, N. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619307 · Cited by 2 · see citing works
“Based on the capacity of the average-power-constrained Poisson channel [11], it was conjectured [9, Conjecture 4] that the capacity scales as log r n + o n (1) .”
BackgroundMethodResultInfluentialSelf-citationIdentification Over Permutation Channels
Sarkar, A., & Dey, B. K. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3582862 · Cited by 2 · see citing works
“See [40] for a comprehensive study of DNA-based storage systems.”
Message Identification Over Binary Noisy Permutation Channels
Sarkar, A., & Dey, B. K. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195449 · Cited by 2 · see citing works
“Permutation channel models the out-of-order arrival of symbols in applications like diffusion-based molecular communication [2], [3], DNA-based storage systems [4], [5], multipath routing in distributed networks [6], [7].”
An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads
Welter, L., Sokolovskii, R., Heinis, T., Wachter-Zeh, A., Rosnes, E., & Amat, A. G. I. (2026) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2026.3655592 · Cited by 6 · see citing works
“For a detailed overview of information-and coding-theoretic contributions to DNA-based storage, we refer to [22], [23], [24], and [25].”
Tamir, R., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3599794 · Cited by 1 · see citing works
“More concretely, in the DNA storage channel model, also referred to as the shuffling channel [35], K molecules are stored, each has length L = β log K symbols from the alphabet A = { A , C , G , T } .”
InfluentialAchievable Rates of Frequency-based Channels of Unlimited Input Resolution
Tamir, R., & Weinberger, N. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195540 · Cited by 1 · see citing works
“Concretely, in the DNA storage channel model, also referred to as the shuffling channel [19], K molecules are stored, each has length L = β log |A| K symbols from the alphabet A = { A , C , G , T } .”
Random Access in DNA Storage: Algorithms, Constructions, and Bounds
Wang, C., & Yaakobi, E. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653637 · Cited by 1 · see citing works
“Despite the immense potential of DNA storage, current sequencing technologies remain costly compared to conventional digital storage systems [7, 8].”
On the Capacity of Noisy Frequency-based Channels
Gerzon, Y., Shomorony, I., & Weinberger, N. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653715
“The result is a fundamental dichotomy regarding the capacity [10]: In the long-molecule regime , where β > 1 log |A| , capacity is achieved by indexing: reserving a portion of the strand to store an ID, effectively restoring order [10].”
InfluentialSelf-citationInformation Rates Over DMCs with Many Independent Views
Rameshwar, V. A., & Weinberger, N. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619212 · Cited by 1 · see citing works
Exact Error Exponents of Concatenated Codes for DNA Storage
Ling, Y. H., & Scarlett, J. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3581559 · Cited by 1 · see citing works
“I N RECENT years, significant research attention has been paid to characterizing the capacity of DNA storage systems; see [1] for a recent overview.”
On Achievable Rates Over Noisy Nanopore Channels
Rameshwar, V. A., & Weinberger, N. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240460
Applications of combinatorics in coding theory
Dao, D. T. (2023) · doi:10.32657/10356/165395 · Cited by 1 · see citing works
Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes
Ling, Y. H., & Scarlett, J. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619142
“While we obtain exact exponents for the class considered, we note that this class itself can be suboptimal, as it precludes certain advanced techniques such as clustering [1, Sec.”
BackgroundMethodSemantic Communication Over Channels With Insertions, Deletions, and Substitutions
Ozates, T., & Koç, A. (2025) · IEEE Communications Letters · doi:10.1109/lcomm.2025.3533928
“These types of channels occur in many scenarios like wireless communications [13], [14], file synchronization [15], bit-patterned media [16], race-track memories [17], and DNA storage [18].”
Error Exponents for DNA Storage Codes With a Variable Number of Reads
Ling, Y. H., Weinberger, N., & Scarlett, J. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3590758
“Condition (i) is complicated by the fact that existing upper bounds on capacity typically rely on Fano’s inequality (e.g., see [1], [4]), which only gives a weak converse.”
InfluentialEfficient trace reconstruction in DNA storage systems using bidirectional beam search
Gu, Z., Xin, H., Sharma, P., Goh, G. Y., Wong, L., & Nagarajan, N. (2025) · iScience · doi:10.1016/j.isci.2025.113791
Progressive decoding of DNA-stored JPEG data with on-the-fly error correctionPreprint
Nawaz, I., Agarwal, P., & Heinis, T. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.10.26.684640
“Error-correcting codes introduce redundant information when encoding, allowing for erroneous data to be recovered [45] at a cost of increased storage size.”
Model for InDels and Substitutions in Nanopore DNA Storage Based on Measured Data
Farkas, P., Farkašová, K., & Janvars, T. (2025) · International Conference on Electrical and Computer Engineering Researches (ICECER) · doi:10.1109/icecer65523.2025.11400833
Optimized End-to-End Coding Workflow for Image Storage and Retrieval Using JPEG DNA
Testolina, M., Hanna, S. K., & Antonini, M. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11460799
Propelling DNA-Based Archival Storage With an Algorithmic Mindset
Yang, Y., Wei, W., & Mou, M. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3694522
“Westart with the (multi-draw) DNA storage channel [122] (see Figure 4) and a simplified model [123] (called the noisy shuffling-sampling channel with single draws) where a strand is either observed once or drawn never.”
InfluentialMa, G., Jiao, X., Mu, J., et al. (2026) · IEEE Transactions on Communications · doi:10.1109/tcomm.2026.3698858
“Such errors arise inevitably in emerging storage systems, including DNA storage [2] and racetrack memory [3].”
Realistic Channel Model with Memory and Clustering for DNA Data Storage Using Nanopore Sequencing
Janvars, T., & Farkaš, P. (2026) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet65726.2026.11632588 · Cited by 1 · see citing works
Message Identification Over Noisy Permutation Channels: Deterministic Encoding and Feedback
Sarkar, A., & Dey, B. K. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11654043
Coverage Depth Analysis: Random Access for DNA Storage over Noisy Channels
Abraham, H., Feldman, I., & Yaakobi, E. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653660
“However, current DNA sequencing technologies suffer from limited throughput and high cost compared to conventional solutions [7]–[9].”
- Authors
- Shomorony, I., & Heckel, R.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Technical University of Munich (DE)
- Venue
- Foundations and Trends® in Communications and Information Theory
- Publisher
- Emerald
- Published
- 2022-02-24
- Volume
- 19
- Issue
- 1
- Pages
- 1-106
- ISSN
- 1567-2190 (ISSN-L)
- 1567-2328
- OpenAlex
- W4213456065
- Cited by
- 62
- References
- 121
- Citations by year
- 2026: 11 · 2025: 17 · 2024: 20 · 2023: 12 · 2022: 2
- FWCI
- 4.17
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Foundations and Trends® in Communications and Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (2007597)
- European Commission (964995)
- Technische Universität München
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Keywords
- DNA data storage, information-theoretic limits, channel capacity, random sampling, data archiving
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
