Fundamental limits of DNA storage systems
The DOI matches its Crossref record; 11 of the 12 references it cites were found in a registry or an index.
Abstract
Due to its longevity and enormous information density, DNA is an attractive medium for archival storage. In this work, we study the fundamental limits and tradeoffs of DNA-based storage systems under a simple model, motivated by current technological constraints on DNA synthesis and sequencing. Our model captures two key distinctive aspects of DNA storage systems: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the data is read by randomly sampling from this DNA pool. Under this model, we characterize the storage capacity, and show that a simple index-based coding scheme is optimal.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In 2017, Heckel et al. considered the storage capacity using both assembly methods and have shown that an index-based coding system is optimal for data storage purposes [31].”
From DNA Data Storage. (2023) · cites this paper as [31]
Citations
Cites
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 · cited 4×
“Several works [CGK12; Gol+13; Gra+15; Bor+16; EZ17; Yaz+15a] have demonstrated that writing, storing, and retrieving data on the order of megabytes is possible with today’s technology, and achieves information densities and information lifetimes [Gra+15] that are far beyond what state-of-the-art…”
BackgroundInfluentialTowards 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
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898
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 · cited 1×
“Several works [2– 4, 6, 7, 13] have demonstrated that writing, storing, and retrieving data on the order of megabytes is possible with today’s technology, and achieves information densities and information lifetimes [7] that are far beyond what state-of-theart tapes and discs achieve.”
BackgroundSelf-citationA Rewritable, Random-Access DNA-Based Storage System
Tabatabaei Yazdi, S. M. H., Yuan, Y., Ma, J., Zhao, H., & Milenkovic, O. (2015) · Scientific Reports · doi:10.1038/srep14138 · Cited by 401
A DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/2872362.2872397 · Cited by 316
DNA-Based Storage: Trends and Methods
Yazdi, S. M. H. T., Kiah, H. M., Garcia-Ruiz, E., Ma, J., Zhao, H., & Milenkovic, O. (2015) · IEEE Transactions on Molecular, Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2016.2537305 · Cited by 278 · cited 1×
“We refer to [4, 12] for a survey and an overview of the recent advances in the area.”
BackgroundBuilding an Associative Memory Vastly Larger Than the Brain
Baum, E. B. (1995) · Science · doi:10.1126/science.7725109 · Cited by 168 · cited 1×
“The idea to store information on DNA is relatively new [Bau95], and has recently gained significant attention [CGK12; Gol+13; Gra+15; Bor+16; EZ17; Yaz+15a], due to advances in synthesis and sequencing.”
BackgroundCodes 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 124
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 · cited 1×
“Some of these aspects include DNA synthesis constraints such as sequence composition [4, 8, 13], the asymmetric nature of the DNA sequencing error channel [5], the need for codes that correct insertion errors [10], and the need for techniques to allow random access [13].”
Background
Research works printed but not linked: 3
- sayir, 2016, Codes for efficient data storage on DNA molecules, Talk at Inform Inference and Energy symposium Cambridge UK
- heckel, 2017, Fundamental Limits of DNA Storage Systems
- mackay, 2015, Near-capacity codes for fountainchannels with insertions, deletions, and substitutions, with applications to DNA archives, Unpublished manuscript
Cited by
Molecular Digital Data Storage Using DNA
Ceze, L., Nivala, J., & Strauss, K. (2019) · Nature Reviews Genetics · doi:10.1038/s41576-019-0125-3 · Cited by 551
DNA stability: a central design consideration for DNA data storage systems
Matange, K., Tuck, J. M., & Keung, A. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21587-5 · Cited by 209
Reading and Writing Digital Data in DNA
Meiser, L. C., Antkowiak, P. L., Koch, J., Chen, W. D., Kohll, A. X., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Protocols · doi:10.1038/s41596-019-0244-5 · Cited by 164
“TROUBLESHOOTING 8 Purify the band at 120 – 170 nt (depending on the synthesized oligo length) with the QIAquick PCR Puri fi cation Kit according to the supplier ’ s instructions.”
MethodInfluentialSelf-citationTowards practical and robust DNA-based data archiving using the yin–yang codec system
Ping, Z., Chen, S., Zhou, G., Huang, X., Zhu, S. J., Zhang, H., Lee, H. H., Lan, Z., Cui, J., Chen, T., et al. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00231-2 · Cited by 165
High Density DNA Data Storage Library via Dehydration with Digital Microfluidic Retrieval
Newman, S., Stephenson, A. P., Willsey, M., Nguyen, B. H., Takahashi, C. N., Strauss, K., & Ceze, L. (2019) · Nature Communications · doi:10.1038/s41467-019-09517-y · Cited by 144
Metadata
- Authors
- Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C.
- Affiliations
- University of California, Berkeley (US)
- Stanford University (US)
- Venue
- 2017 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 3130-3134
- OpenAlex
- W2615068531
- Semantic Scholar
- cf0d56fc56021a46bbea4fefcb4fbdc27bfc0baf
- Cited by
- 123
- References
- 12
- Citations by year
- 2026: 4 · 2025: 17 · 2024: 11 · 2023: 16 · 2022: 15 · 2021: 19 · 2020: 17 · 2019: 17 · 2018: 5 · 2017: 2
- FWCI
- 41.67
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE International Symposium on Information Theory (ISIT) (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Keywords
- DNA data storage, fundamental limits, storage capacity, random sampling, archival storage, information density
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fundamental limits of DNA storage systems. https://app.cochat.ai/papers/10.1109/isit.2017.8007106
- The paper
- Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C. (2017). Fundamental limits of DNA storage systems. 2017 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2017.8007106
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.