DNA Fountain enables a robust and efficient storage architecture
Open accessPublished version of a preprint
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Abstract
A reliable and efficient DNA storage architecture: DNA has the potential to provide large-capacity information storage. However, current methods have only been able to use a fraction of the theoretical maximum. Erlich and Zielinski present a method, DNA Fountain, which approaches the theoretical maximum for information stored per nucleotide. They demonstrated efficient encoding of information—including a full computer operating system—into DNA that could be retrieved at scale after multiple rounds of polymerase chain reaction. Science , this issue p. 950
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 cited source doesn’t support the claim as written.
In the citing paper
“with a minimum copy number of 10 we show this process yields the densest DNA storage system to date at 17 exabytes per gram (EB g−1).”
From Probing the physical limits of reliable DNA data retrieval. (2020) · cites this paper as [7]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Indeed, prior work also found that PCR copy data from a deeply diluted oligo pool resulted in dramatic bias, which is less suitable for data recovery10.”
From Quantifying Molecular Bias in DNA Data Storage (2019) · cites this paper as [10]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Later in 2017, by applying fountain codes, Erlich and Zielinski (2017) established an architecture which achieves ultra-high coding efficiency (bits per base) and enables PCR-based copy free DNA data storage.”
From Large-Scale de Novo Oligonucleotide Synthesis for Whole-Genome Synthesis and Data Storage: Challenges and Opportunities (2021) · cites this paper as Erlich and Zielinski, 2017
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The storage density has increased from 2.2 PB/g (petabytes per gram DNA) to 17,000 PB/g (Erlich and Zielinski, 2017; Organick et al., 2020).”
From Large-Scale de Novo Oligonucleotide Synthesis for Whole-Genome Synthesis and Data Storage: Challenges and Opportunities (2021) · cites this paper as Erlich and Zielinski, 2017
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Because encapsulation of the DNA file sequence relies only on electrostatic interactions between positively-charged silica and the phosphate backbone of DNA, our approach can equally encapsulate any molecular weight of DNA molecule applicable to MB and larger file sizes, as demonstrated previously23, and is compatible with alternative DNA file compositions such as 100–200-mer oligonucleotides that”
From Random access DNA memory using Boolean search in an archival file storage system (2021) · cites this paper as [11]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
PEAR: a fast and accurate Illumina Paired-End reAd mergeR
Zhang, J., Kobert, K., Flouri, T., & Stamatakis, A. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btt593 · Cited by 4,497
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
Shokrollahi, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874390 · Cited by 2,154
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
Shokrollahi, A. (2007) · Cited by 1,256
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
Characterizing and measuring bias in sequence data
Ross, M. G., Russ, C., Costello, M., Hollinger, A., Lennon, N. J., Hegarty, R., Nusbaum, C., & Jaffe, D. B. (2013) · Genome Biology · doi:10.1186/gb-2013-14-5-r51 · Cited by 909
MacKay, D. J. C. (2005) · IEE Proceedings - Communications · doi:10.1049/ip-com:20050237 · Cited by 899
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
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
Quake: quality-aware detection and correction of sequencing errors
Kelley, D. R., Schatz, M. C., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-11-r116 · Cited by 582
A digital fountain approach to asynchronous reliable multicast
Byers, J. W., Luby, M., & Mitzenmacher, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803996 · Cited by 580
A 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
Forward Error Correction for DNA Data Storage
Blawat, M., Gaedke, K., Hütter, I., Chen, X.-M., Turczyk, B., Inverso, S., Pruitt, B. W., & Church, G. M. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.05.398 · Cited by 333
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
Faircloth, B. C., & Glenn, T. C. (2012) · PLoS ONE · doi:10.1371/journal.pone.0042543 · Cited by 289
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
Scalable gene synthesis by selective amplification of DNA pools from high-fidelity microchips
Kosuri, S., Eroshenko, N., LeProust, E. M., Super, M., Way, J., Li, J. B., & Church, G. M. (2010) · Nature Biotechnology · doi:10.1038/nbt.1716 · Cited by 272
Between a chicken and a grape: estimating the number of human genes
Pertea, M., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/1465-6906-11-s1-i1 · Cited by 252
A generalized geometric distribution and some of its properties
Philippou, A. N., Georghiou, C., & Philippou, G. N. (1983) · Statistics & Probability Letters · doi:10.1016/0167-7152(83)90025-1 · Cited by 226
Long-Term Storage of Information in DNA
Bancroft, C., Bowler, T., Bloom, B., & Clelland, C. T. (2001) · Science · doi:10.1126/science.293.5536.1763c · Cited by 192
DNA Sudoku—harnessing high-throughput sequencing for multiplexed specimen analysis
Erlich, Y., Chang, K., Gordon, A., Ronen, R., Navon, O., Rooks, M., & Hannon, G. J. (2009) · Genome Research · doi:10.1101/gr.092957.109 · Cited by 160
Self-citationPhenotypic connections in surprising places
Linghu, B., & DeLisi, C. (2010) · Genome Biology · doi:10.1186/gb-2010-11-4-116 · Cited by 129
How DNA could store all the world’s data
Extance, A. (2016) · Nature · doi:10.1038/537022a · Cited by 125
Accurate gene synthesis with tag-directed retrieval of sequence-verified DNA molecules
Schwartz, J. J., Lee, C., & Shendure, J. (2012) · Nature Methods · doi:10.1038/nmeth.2137 · Cited by 94
A DNA-Based Archival Storage System
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K. (2016) · ACM SIGOPS Operating Systems Review · doi:10.1145/2954680.2872397 · Cited by 77
Efficiency, error and yield in light-directed maskless synthesis of DNA microarrays
Agbavwe, C., Kim, C., Hong, D., Heinrich, K., Wang, T., & Somoza, M. M. (2011) · Journal of Nanobiotechnology · doi:10.1186/1477-3155-9-57 · Cited by 76
Ananda, G., Walsh, E. M., Jacob, K. D., Krasilnikova, M. M., Eckert, K. A., Chiaromonte, F., & Makova, K. D. (2012) · Genome Biology and Evolution · doi:10.1093/gbe/evs116 · Cited by 70
Application Layer Forward Error Correction for Mobile Multimedia Broadcasting
Stockhammer, T., Shokrollahi, A., Watson, M., Luby, M. G., & Gasiba, T. E. (2008) · Auerbach Publications eBooks · doi:10.1201/9781420053890-10 · Cited by 59
Efficient study design for next generation sequencing
Sampson, J. N., Jacobs, K. B., Yeager, M., Chanock, S. J., & Chatterjee, N. (2011) · Genetic Epidemiology · doi:10.1002/gepi.20575 · Cited by 54
DNA Fountain enables a robust and efficient storage architecturePreprint
Erlich, Y., & Zielinski, D. (2016) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/074237 · Cited by 45
Self-citationCharacterization of Luby Transform Codes with Small Message Size for Low-Latency Decoding
Bodine, E. A., & Cheng, M. (2008) · International Conference on Communications · doi:10.1109/icc.2008.233 · Cited by 43
Gene Assembly from Chip‐Synthesized Oligonucleotides
Eroshenko, N., Kosuri, S., Marblestone, A. H., Conway, N., & Church, G. M. (2012) · Current Protocols in Chemical Biology · doi:10.1002/9780470559277.ch110190 · Cited by 26
On geometric distributions of order (k1,…,km)
Ling, K. D. (1990) · Statistics & Probability Letters · doi:10.1016/0167-7152(92)90012-t · Cited by 22
Fu, J. C., & Lou, W. Y. W. (2006) · Annals of the Institute of Statistical Mathematics · doi:10.1007/s10463-006-0038-8 · Cited by 13
MOLECULAR CYBERNETICS: THE NEXT STEP?
Wallace, M. R. (1978) · Kybernetes · doi:10.1108/eb005489 · Cited by 5
Research works printed but not linked: 6
- 10.1145/584091.584093 · DOI
- D. J. C. MacKay Information Theory Inference & Learning Algorithms (Cambridge Univ. Press 2002).
- U. Demir O. Aktas in 2006 International Symposium on Computer Networks [Institute of Electrical and Electronics Engineers (IEEE) 2006] pp. 264–269.
- M. Luby “LT codes ” in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (IEEE 2002) pp. 271–280.
- W. Feller vol. I of An Introduction to Probability Theory and Its Applications (Wiley 1950).
- O. G.Madge, D. J.MacKay, Efficient fountain codes for medium blocklengths. IEEE Trans. Commun. •••, 1 (2006). www.inference.phy.cam.ac.uk/oghm2/files/fountain-draft.pdf
Cited by
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
“As expected, the ratio decreased with”
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
Nuclease resistance of DNA nanostructures
Chandrasekaran, A. R. (2021) · Nature Reviews Chemistry · doi:10.1038/s41570-021-00251-y · Cited by 382
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
CRISPR-Cas Encoding of a Digital Movie into the Genomes of a Population of Living Bacteria
Shipman, S. L., Nivala, J., Macklis, J. D., & Church, G. M. (2017) · Nature · doi:10.1038/nature23017 · Cited by 361
Metadata
- Authors
- Erlich, Y., & Zielinski, D.
- Affiliations
- New York Genome Center (US)
- Corresponding author
- Erlich, Yaniv
- Venue
- Science
- Published
- 2017-03-03
- Volume
- 355
- Issue
- 6328
- Pages
- 950-954
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2592122940
- Cited by
- 898
- References
- 37
- Citations by year
- 2026: 90 · 2025: 135 · 2024: 124 · 2023: 115 · 2022: 94 · 2021: 94 · 2020: 93 · 2019: 72 · 2018: 54 · 2017: 26
- FWCI
- 27.23
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- cc-by-nc
- Locations
- Science (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc)
- PubMed (publishedVersion)
- Funders
- Burroughs Wellcome Fund
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
- Keywords
- DNA data storage, DNA encoding, PCR
- MeSH terms
- Algorithms, Base Sequence, DNA, Oligonucleotides, Information Storage and Retrieval, Libraries, Digital, High-Throughput Nucleotide Sequencing
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
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.