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) · IEEE Information Theory Workshop (ITW) · Cited by 1,226
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
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
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
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
Functional Nucleic Acid Nanomaterials: Development, Properties, and Applications
Xu, W., He, W., Du, Z., Zhu, L., Huang, K., Lu, Y., & Luo, Y. (2021) · Angewandte Chemie International Edition · doi:10.1002/anie.201909927 · Cited by 231
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
DNA storage: research landscape and future prospects
Dong, Y., Sun, F., Ping, Z., Ouyang, Q., & Qian, L. (2020) · National Science Review · doi:10.1093/nsr/nwaa007 · Cited by 225
“, a single base can still correspond to two binary digits, with unqualified sequences discarded altogether in transmission [19].”
BackgroundMethodInfluentialEncoding information into polymers
Rutten, M. G. T. A., Vaandrager, F. W., Elemans, J. A. A. W., & Nolte, R. J. M. (2018) · Nature Reviews Chemistry · doi:10.1038/s41570-018-0051-5 · Cited by 216
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
HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints
Press, W. H., Hawkins, J. A., Jones, S. K., Schaub, J. M., & Finkelstein, I. J. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2004821117 · Cited by 183
“6 has the same code rate as [ 5 ].”
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
Self-citationAntkowiak, 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
DNA-based memory devices for recording cellular events
Sheth, R. U., & Wang, H. H. (2018) · Nature Reviews Genetics · doi:10.1038/s41576-018-0052-8 · Cited by 172
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
Digital Data Storage Using DNA Nanostructures and Solid-State Nanopores
Chen, K., Kong, J., Zhu, J., Ermann, N., Predki, P., & Keyser, U. F. (2019) · Nano Letters · doi:10.1021/acs.nanolett.8b04715 · Cited by 164
Towards 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
Random access DNA memory using Boolean search in an archival file storage system
Banal, J. L., Shepherd, T. R., Berleant, J., Huang, H., Reyes, M., Ackerman, C. M., Blainey, P. C., & Bathe, M. (2021) · Nature Materials · doi:10.1038/s41563-021-01021-3 · Cited by 143
DNA assembly for nanopore data storage readout
Lopez, R., Chen, Y.-J., Dumas Ang, S., Yekhanin, S., Makarychev, K., Racz, M. Z., Seelig, G., Strauss, K., & Ceze, L. (2019) · Nature Communications · doi:10.1038/s41467-019-10978-4 · Cited by 142
Demonstration of End-to-End Automation of DNA Data Storage.
Takahashi, C. N., Nguyen, B. H., Strauss, K., & Ceze, L. (2019) · Scientific Reports · doi:10.1038/s41598-019-41228-8 · Cited by 137
Coding Over Sets for DNA Storage
Lenz, A., Siegel, P. H., Wachter-Zeh, A., & Yaakobi, E. (2018) · IEEE Transactions on Information Theory · doi:10.1109/isit.2018.8437544 · Cited by 158
An Artificial Chromosome for Data Storage
Chen, W., Han, M., Zhou, J., Ge, Q., Wang, P., Zhang, X., Zhu, S., Song, L., & Yuan, Y. (2021) · National Science Review · doi:10.1093/nsr/nwab028 · Cited by 136
Probing the physical limits of reliable DNA data retrieval.
Organick, L., Chen, Y.-J., Dumas Ang, S., Lopez, R., Liu, X., Strauss, K., & Ceze, L. (2020) · Nature Communications · doi:10.1038/s41467-020-14319-8 · Cited by 135
Nanopore-Based DNA Hard Drives for Rewritable and Secure Data Storage
Chen, K., Zhu, J., Bošković, F., & Keyser, U. F. (2020) · Nano Letters · doi:10.1021/acs.nanolett.0c00755 · Cited by 134
Aksakal, R., Mertens, C., Soete, M., Badi, N., & Prez, F. D. (2021) · Advanced Science · doi:10.1002/advs.202004038 · Cited by 146
Al Ouahabi, A., Amalian, J.-A., Charles, L., & Lutz, J.-F. (2017) · Nature Communications · doi:10.1038/s41467-017-01104-3 · Cited by 131
“For example, it has been reported that ordered oligonucleotide sequences enable storage of several kilobytes of data in DNA chains 4 – 7 .”
DNA as a universal chemical substrate for computing and data storage
Yang, S., Bögels, B. W. A., Wang, F., Xu, C., Dou, H., Mann, S., Fan, C., & de Greef, T. F. A. (2024) · Nature Reviews Chemistry · doi:10.1038/s41570-024-00576-4 · Cited by 167
“More advanced error correcting has been realized by using algorithms developed for telecommunication, such as XOR encoding 168 , Reed Solomon codes 165,169,170 and fountain codes 171,172 .”
Choi, Y., Ryu, T., Lee, A. C., Choi, H., Lee, H., Park, J., Song, S.-H., Kim, S., Kim, H., Park, W., et al. (2019) · Scientific Reports · doi:10.1038/s41598-019-43105-w · Cited by 128
“Although we synthesized oligonucleotide variants in single designed fragments to incorporate the degenerate bases, fewer oligonucleotide molecules per fragment (hundreds) were sufficient to decode the data, than that in a previous report 10 .”
BackgroundResultInfluentialSynthetic DNA applications in information technology
Meiser, L. C., Nguyen, B. H., Chen, Y.-J., Nivala, J., Strauss, K., Ceze, L., & Grass, R. N. (2022) · Nature Communications · doi:10.1038/s41467-021-27846-9 · Cited by 127
“The procedure, similarly to the DNA data storage procedure, starts with an error-correction code converting a digital fi le (bits) into DNA (nucleotides) 25 and adding information redundancy, such that a given dropout of sequences is allowed for a full recovery of the digital fi le.”
MethodFundamental limits of DNA storage systems
Heckel, R., Shomorony, I., Ramchandran, K., & Tse, D. N. C. (2017) · 2017 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2017.8007106 · Cited by 123
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
Dynamic and scalable DNA-based information storage
Lin, K. N., Volkel, K., Tuck, J. M., & Keung, A. J. (2020) · Nature Communications · doi:10.1038/s41467-020-16797-2 · Cited by 117
“In this case, ss-dsDNA strands drive multiple powerful capabilities for DNA storage: (1) it provides a physical handle for files and allows files to be accessed isothermally; (2) it increases the theoretical information density and capacity of DNA storage by inhibiting non-specific binding within data payloads and red…”
BackgroundPhoton-directed multiplexed enzymatic DNA synthesis for molecular digital data storage
Lee, H., Wiegand, D. J., Griswold, K., Punthambaker, S., Chun, H., Kohman, R. E., & Church, G. M. (2020) · Nature Communications · doi:10.1038/s41467-020-18681-5 · Cited by 114
Bi, D., Almpanis, A., Noel, A., Deng, Y., & Schober, R. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3066117 · Cited by 134
Data storage in sequence-defined macromolecules via multicomponent reactions
Boukis, A. C., & Meier, M. A. R. (2018) · European Polymer Journal · doi:10.1016/j.eurpolymj.2018.04.038 · Cited by 110
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 116
Storage of Information Using Small Organic Molecules
Cafferty, B. J., Ten, A. S., Fink, M. J., Morey, S., Preston, D. J., Mrksich, M., & Whitesides, G. M. (2019) · ACS Central Science · doi:10.1021/acscentsci.9b00210 · Cited by 107
Terminal Deoxynucleotidyl Transferase in the Synthesis and Modification of Nucleic Acids
Sarac, I., & Hollenstein, M. (2018) · ChemBioChem · doi:10.1002/cbic.201800658 · Cited by 108
Chen, W. D., Kohll, A. X., Nguyen, B. H., Koch, J., Heckel, R., Stark, W. J., Ceze, L., Strauss, K., & Grass, R. N. (2019) · Advanced Functional Materials · doi:10.1002/adfm.201901672 · Cited by 104
Robust data storage in DNA by de Bruijn graph-based de novo strand assembly
Song, L., Geng, F., Gong, Z.-Y., Chen, X., Tang, J., Gong, C., Zhou, L., Xia, R., Han, M., Xu, J.-Y., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-33046-w · Cited by 114
Driving the Scalability of DNA-Based Information Storage Systems
Tomek, K. J., Volkel, K., Simpson, A., Hass, A. G., Indermaur, E. W., Tuck, J. M., & Keung, A. J. (2019) · ACS Synthetic Biology · doi:10.1021/acssynbio.9b00100 · Cited by 100
Nucleic Acid Based Constitutional Dynamic Networks: From Basic Principles to Applications
Yue, L., Wang, S., Zhou, Z., & Willner, I. (2020) · Journal of the American Chemical Society · doi:10.1021/jacs.0c09891 · Cited by 96
Welzel, M., Schwarz, P. M., Löchel, H. F., Kabdullayeva, T., Clemens, S., Becker, A., Freisleben, B., & Heider, D. (2023) · Nature Communications · doi:10.1038/s41467-023-36297-3 · Cited by 121
“…to three published codes with open-source implementations: the code published by Grass et al. 10 (further referred to as Grass code), DNA Fountain 11 , and HEDGES 12 (we will further refer to Hedges as the complete construct of inner-outer concatenated code that the authors described, and HEDGES…”
BackgroundMethodInfluentialLee, J. M., Koo, M. B., Lee, S. W., Lee, H., Kwon, J.-H., Shim, Y. H., Kim, S. Y., & Kim, K. T. (2020) · Nature Communications · doi:10.1038/s41467-019-13952-2 · Cited by 104
An Image Encryption Method Based on the Feistel Network and Dynamic DNA Encoding
Zhang, X., Zhou, Z., & Niu, Y. (2018) · IEEE photonics journal · doi:10.1109/jphot.2018.2859257 · Cited by 109
“The huge parallelism, ultrahigh storage density and ultra-low energy consumption of DNA are being developed for molecular computing, data storage, cryptography and other fields, which may eventually lead to the birth of new computers, new data storage and new cryptography systems, triggering a new information revoluti…”
BackgroundBioinspired MXene-integrated colloidal crystal arrays for multichannel bioinformation coding
Bian, F., Sun, L., Cai, L., Wang, Y., & Zhao, Y. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2011660117 · Cited by 93
Indel-correcting DNA barcodes for high-throughput sequencing
Hawkins, J. A., Jones, S. K., Finkelstein, I. J., & Press, W. H. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1802640115 · Cited by 98
“Many current DNA barcode strategies repurpose error-correcting codes developed for computers (18, 19), such as Hamming or Reed–Solomon codes, to DNA applications (20, 21).”
Hao, Y., Li, Q., Fan, C., & Wang, F. (2021) · Small Structures · doi:10.1002/sstr.202000046 · Cited by 90
Scaling DNA data storage with nanoscale electrode wells
Nguyen, B. H., Takahashi, C. N., Gupta, G., Smith, J. A., Rouse, R., Berndt, P., Yekhanin, S., Ward, D. P., Ang, S. D., Garvan, P., et al. (2021) · Science Advances · doi:10.1126/sciadv.abi6714 · Cited by 90
Song, B., Lu, D. L., Qin, A., & Tang, B. Z. (2021) · Journal of the American Chemical Society · doi:10.1021/jacs.1c10612 · Cited by 91
Parallel molecular data storage by printing epigenetic bits on DNA
Zhang, C., Wu, R., Sun, F., Lin, Y., Liang, Y., Liang, Y., Chen, Y., Teng, J., Song, Z., Liu, N., et al. (2024) · Nature · doi:10.1038/s41586-024-08040-5 · Cited by 114
“Inspired by the way genetic information is preserved in nature, DNA has been recently considered a promising biomaterial for digital data storage owing to its extraordinary storage density and durability 1–3 .”
BackgroundYang, C., Gan, X., Zeng, Y., Xu, Z., Xu, L., Hu, C., Ma, H., Chai, B., Hu, S., & Chai, B. (2023) · Biosensors and Bioelectronics · doi:10.1016/j.bios.2023.115723 · Cited by 88
Molecular-level similarity search brings computing to DNA data storage
Bee, C., Chen, Y.-J., Queen, M., Ward, D., Liu, X., Organick, L., Seelig, G., Strauß, K., & Ceze, L. (2021) · Nature Communications · doi:10.1038/s41467-021-24991-z · Cited by 105
Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage
Nguyen, T. T., Cai, K., Immink, K. A. S., & Kiah, H. M. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3066430 · Cited by 101
Biological HCI: Towards Integrative Interfaces Between People, Computer, and Biological Materials
Pataranutaporn, P., Ingalls, T., & Finn, E. (2018) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/3170427.3188662 · Cited by 97
High-throughput DNA synthesis for data storage
Yu, M., Tang, X., Li, Z., Wang, W., Wang, S., Li, M., Yu, Q., Xie, S., Zuo, X., & Chen, C. Q. (2024) · Chemical Society Reviews · doi:10.1039/d3cs00469d · Cited by 101
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
Wang, S., Mao, X., Wang, F., Zuo, X., & Fan, C. (2023) · Advanced Materials · doi:10.1002/adma.202307499 · Cited by 101
An alternative approach to nucleic acid memory
Dickinson, G. D., Mortuza, G. M., Clay, W., Piantanida, L., Green, C. M., Watson, C., Hayden, E. J., Andersen, T., Kuang, W., Graugnard, E., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-22277-y · Cited by 82
An image encryption approach based on chaotic maps and genetic operations
Niu, Y., Zhou, Z., & Zhang, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09237-2 · Cited by 88
Addressable configurations of DNA nanostructures for rewritable memory
Chandrasekaran, A. R., Levchenko, O., Patel, D. S., MacIsaac, M., & Halvorsen, K. (2017) · Nucleic Acids Research · doi:10.1093/nar/gkx777 · Cited by 79
Xu, C., Ma, B., Gao, Z., Dong, X., Zhao, C., & Liu, H. (2021) · Science Advances · doi:10.1126/sciadv.abk0100 · Cited by 79
Codes With Run-Length and GC-Content Constraints for DNA-Based Data Storage
Song, W., Cai, K., Zhang, M., & Yuen, C. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2866566 · Cited by 81
“, the ratio of the number of G and C symbols to the length of the sequence) are two major factors affecting the synthesis and sequencing errors [7].”
BackgroundMethodMao, M., Lin, Z., Chen, L., Zou, Z., Zhang, J., Dou, Q., Wu, J., Chen, J., Wu, M., Niu, L., et al. (2023) · Journal of the American Chemical Society · doi:10.1021/jacs.2c13825 · Cited by 81
Choi, Y., Bae, H. J., Lee, A. C., Choi, H., Lee, D., Ryu, T., Hyun, J., Kim, S., Kim, H., Song, S., et al. (2020) · Advanced Materials · doi:10.1002/adma.202001249 · Cited by 77
Pataranutaporn, P., Vujic, A., Kong, D. S., Maes, P., & Sra, M. (2020) · Augmented Humans International Conference (AHs) · doi:10.1145/3384657.3384783 · Cited by 103
“215 petabytes (215 million gigabytes) could be stored in a single gram of DNA [14].”
BackgroundImproved read/write cost tradeoff in DNA-based data storage using LDPC codes
Chandak, S., Tatwawadi, K., Lau, B., Mardia, J., Kubit, M., Neu, J., Griffin, P., Wootters, M., Weissman, T., & Ji, H. (2019) · 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2019.8919890 · Cited by 80
“RS+RLL [4] Fountain+RS [1] Exp. 1 1 and 2.”
BackgroundMethodInfluentialSong, L.-F., Deng, Z.-H., Gong, Z.-Y., Li, L.-L., & Li, B.-Z. (2021) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2021.689797 · Cited by 74
“Meanwhile, the function of data copy (Erlich and Zielinski, 2017), random access (Yazdi et al., 2015; Organick et al., 2018), long-term stability (Grass et al., 2015; Chen W. D. et al., 2019) have also achieved outstanding outcomes.”
BackgroundMethodInfluentialMulticomponent molecular memory
Arcadia, C. E., Kennedy, E., Geiser, J. D., Dombroski, A., Oakley, K., Chen, S., Sprague, L. W., Ozmen, M., Sello, J. K., Weber, P. M., et al. (2020) · Nature Communications · doi:10.1038/s41467-020-14455-1 · Cited by 81
Nucleic Acid Databases and Molecular-Scale Computing
Song, X., & Reif, J. (2019) · ACS Nano · doi:10.1021/acsnano.9b02562 · Cited by 73
He, Z., Shi, K., Li, J., & Chao, J. (2023) · iScience · doi:10.1016/j.isci.2023.106638 · Cited by 72
“while approaching closer to the Shannon capacity of DNA storage than previously reported designs.(114) It encodes an entire computer operating system, movie, and other files with 2.”
ResultDNA-Based Storage: Models and Fundamental Limits
Shomorony, I., & Heckel, R. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3058966 · Cited by 72
Mao, C., Wang, S., Li, J., Feng, Z., Zhang, T., Wang, R., Fan, C., & Jiang, X. (2023) · ACS Nano · doi:10.1021/acsnano.2c11241 · Cited by 73
König, N. F., Ouahabi, A. A., Poyer, S., Charles, L., & Lutz, J. (2017) · Angewandte Chemie International Edition · doi:10.1002/anie.201702384 · Cited by 74
Designing Uncorrelated Address Constrain for DNA Storage by DMVO Algorithm
Cao, B., Ii, X., Zhang, X., Wang, B., Zhang, Q., & Wei, X. (2020) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2020.3011582 · Cited by 70
Construction of Bio-Constrained Code for DNA Data Storage
Wang, Y., Noor‐A‐Rahim, M., Gunawan, E., Guan, Y. L., & Poh, C. L. (2019) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2912572 · Cited by 78
“In [8], two bits were directly mapped to one nucleotide with code rate close to the theoretical channel capacity, while the iterative post-processing impedes the approach as it may cause severe error propagation in decoding [12].”
BackgroundAn 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
“The following PCR protocol was used: (1) 95C for 3 min, (2) 98C for 20 sec, (3) 60C for 15 sec, (4) 72C for 30 sec, (5) repeat steps 2–4 for a total of eight times.”
MethodInfluentialProperties and Constructions of Constrained Codes for DNA-Based Data Storage
Immink, K. A. S., & Cai, K. (2020) · IEEE Access · doi:10.1109/access.2020.2980036 · Cited by 70
Uncertainties in synthetic DNA-based data storage
Xu, C., Zhao, C., Ma, B., & Liu, H. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab230 · Cited by 67
“Droplets of good quality were used for oligonucleotide synthesis (16).”
BackgroundMethodResultInfluentialWang, Q., Yang, Q., & Wu, W. (2020) · Frontiers in Microbiology · doi:10.3389/fmicb.2019.03139 · Cited by 67
Stabilizing synthetic DNA for long-term data storage with earth alkaline salts
Kohll, A. X., Antkowiak, P. L., Chen, W. D., Nguyen, B. H., Stark, W. J., Ceze, L., Strauss, K., & Grass, R. N. (2020) · Chemical Communications · doi:10.1039/d0cc00222d · Cited by 66
Enabling technology and core theory of synthetic biology
Zhang, X., Liu, C., Dai, J., Yuan, Y., Gao, C., Feng, Y. F., Wu, B., Wei, P., You, C., Wang, X., et al. (2023) · Science China Life Sciences · doi:10.1007/s11427-022-2214-2 · Cited by 75
“At a data scale of 2 MB (megabytes, 10 6 bytes), a high storage density of 215 PB/g of DNA (PB, petabytes, 1×10 15 bytes) has been achieved (Erlich and Zielinski, 2017).”
Engineering precise sequence-defined polymers for advanced functions
Shi, Q., Deng, Z., Hou, M., Hu, X., & Liu, S. (2023) · Progress in Polymer Science · doi:10.1016/j.progpolymsci.2023.101677 · Cited by 71
DNA storage in thermoresponsive microcapsules for repeated random multiplexed data access
Bögels, B. W. A., Nguyen, B. H., Ward, D., Gascoigne, L., Schrijver, D. P., Pistikou, A. M., Joesaar, A., Yang, S., Voets, I. K., Mulder, W. J. M., et al. (2023) · Nature Nanotechnology · doi:10.1038/s41565-023-01377-4 · Cited by 80
DNA-based construction at the nanoscale: emerging trends and applications
Xavier, P. L., & Chandrasekaran, A. R. (2018) · Nanotechnology · doi:10.1088/1361-6528/aaa120 · Cited by 74
Integrating DNA Encapsulates and Digital Microfluidics for Automated Data Storage in DNA
Antkowiak, P. L., Koch, J., Nguyen, B. H., Stark, W. J., Strauss, K., Ceze, L., & Grass, R. N. (2022) · Small · doi:10.1002/smll.202107381 · Cited by 65
Tabatabaei, S. K., Pham, B., Pan, C., Liu, J., Chandak, S., Shorkey, S. A., Hernandez, A. G., Aksimentiev, A., Chen, M., Schroeder, C. M., et al. (2022) · Nano Letters · doi:10.1021/acs.nanolett.1c04203 · Cited by 63
Semiautomated synthesis of sequence-defined polymers for information storage
Lee, J. M., Kwon, J.-H., Lee, S. J., Jang, H., Kim, D., Song, J., & Kim, K. T. (2022) · Science Advances · doi:10.1126/sciadv.abl8614 · Cited by 66
Information-Theoretic Foundations of DNA Data Storage
Shomorony, I., & Heckel, R. (2022) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000117 · Cited by 62
DNA as a digital information storage device: hope or hype?
Panda, D., Molla, K. A., Baig, M. J., Swain, A., Behera, D., & Dash, M. (2018) · 3 Biotech · doi:10.1007/s13205-018-1246-7 · Cited by 80
Porphyrin cage compounds based on glycoluril – from enzyme mimics to functional molecular machines
Elemans, J. A. A. W., & Nolte, R. J. M. (2019) · Chemical Communications · doi:10.1039/c9cc04372a · Cited by 61
Capacity Results for the Noisy Shuffling Channel
Shomorony, I., & Heckel, R. (2019) · 2019 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849789 · Cited by 56
“Later, in the same year, Yazdi et al [6] showed how to selectively access files, and in 2017, Erlich and Zielinski [7] demonstrated that practical DNA storage can achieve very high information densities.”
BackgroundCarbon-based archiving: current progress and future prospects of DNA-based data storage.
Ping, Z., Ma, D., Huang, X., Chen, S., Liu, L., Guo, F., Zhu, S. J., & Shen, Y. (2019) · GigaScience · doi:10.1093/gigascience/giz075 · Cited by 55
“In 2017, Erilich and Zielinski used fountain code in their coding scheme [19].”
InfluentialDNA‐Based Concatenated Encoding System for High‐Reliability and High‐Density Data Storage
Ren, Y., Zhang, Y., Liu, Y., Wu, Q., Su, J., Wang, F., Chen, D., Fan, C., Liu, K., & Zhang, H. (2022) · Small Methods · doi:10.1002/smtd.202101335 · Cited by 55
Chandak, S., Neu, J., Tatwawadi, K., Mardia, J., Lau, B. T., Kubit, M. A., Hulett, R., Griffin, P. B., Wootters, M. K., Weissman, T., et al. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053441 · Cited by 71
Computing with biological switches and clocks
Dalchau, N., Szép, G., Hernansaiz-Ballesteros, R. D., Barnes, C. P., Cardelli, L., Phillips, A., & Csikász‐Nagy, A. (2018) · Natural Computing · doi:10.1007/s11047-018-9686-x · Cited by 55
“These properties, combined with the high information storage density of DNA (Church et al. 2012; Goldman et al. 2013; Erlich and Zielinski 2017), provide exciting future directions for further research.”
Cooperative sequence clustering and decoding for DNA storage system with fountain codes
Jeong, J., Park, S., Kim, J.-W., No, J., Jeon, H. H., Lee, J. W., No, A., Kim, S., & Park, H. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btab246 · Cited by 55
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.