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
Items 101–200 of 894
Zheng, L. L., Li, J. Z., Wen, M., Xi, D., Zhu, Y., Wei, Q. L., Zhang, X., Ke, G., Xia, F., & Gao, Z. F. (2023) · Science Advances · doi:10.1126/sciadv.adf5868 · Cited by 55
Digital synthetic polymers for information storage
Yu, L., Chen, B., Li, Z., Huang, Q., He, K., Su, Y., Han, Z., Zhou, Y., Zhu, X., Yan, D., et al. (2023) · Chemical Society Reviews · doi:10.1039/d2cs01022d · Cited by 51
Family of Constrained Codes for Archival DNA Data Storage
Limbachiya, D., Gupta, M. K., & Aggarwal, V. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2861867 · Cited by 55
“Hence, it is required that each DNA codeword should not contain repeated bases (no run-length constraint) [2].”
BackgroundInfluentialInformation stored in nanoscale: Encoding data in a single DNA strand with Base64
Zhang, Y., Kong, L., Wang, F., Li, B., Ma, C., Chen, D., Liu, K., Fan, C., & Zhang, H. (2020) · Nano Today · doi:10.1016/j.nantod.2020.100871 · Cited by 49
Adaptive coding for DNA storage with high storage density and low coverage
Cao, B., Zhang, X., Cui, S., & Zhang, Q. (2022) · npj Systems Biology and Applications · doi:10.1038/s41540-022-00233-w · Cited by 57
Minimum Free Energy Coding for DNA Storage
Cao, B., Zhang, X., Wu, J., Wang, B., Zhang, Q., & Wei, X. (2021) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2021.3056351 · Cited by 53
Fei, Z., Gupta, N., Li, M., Xiao, P., & Hu, X. (2023) · Science Advances · doi:10.1126/sciadv.adg9933 · Cited by 52
“Compared to other methods of DNA storage, our approach was relatively simple, but it required extensive time for swelling/deswelling cycles ( 48 ).”
Efficient DNA-based data storage using shortmer combinatorial encoding
Preuss, I., Rosenberg, M., Yakhini, Z., & Anavy, L. (2024) · Scientific Reports · doi:10.1038/s41598-024-58386-z · Cited by 68
“"Information capacities for selected encodings") 3,4,21,22 .”
Liu, B., Shi, Q., Hu, L., Huang, Z., Zhu, X., & Zhang, Z. (2020) · Polymer Chemistry · doi:10.1039/c9py01939a · Cited by 47
Envisioning innovation opportunities through science fiction
Michaud, T., & Appio, F. P. (2022) · Journal of Product Innovation Management · doi:10.1111/jpim.12613 · Cited by 53
P(V) Reagents for the Scalable Synthesis of Natural and Modified Nucleoside Triphosphates
Liao, J.-Y., Bala, S., Ngor, A. K., Yik, E. J., & Chaput, J. C. (2019) · Journal of the American Chemical Society · doi:10.1021/jacs.9b04728 · Cited by 46
Chemical and photochemical error rates in light-directed synthesis of complex DNA libraries
Lietard, J., Léger, A., Erlich, Y., Sadowski, N., Timp, W., & Somoza, M. M. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab505 · Cited by 50
Self-citationThe current science of sequence-defined macromolecules
Hakobyan, K., Noble, B. B., & Xu, J. (2023) · Progress in Polymer Science · doi:10.1016/j.progpolymsci.2023.101754 · Cited by 44
Mohapatra, B., Pratibha, P., & Verma, S. K. (2017) · Chemical Communications · doi:10.1039/c7cc00222j · Cited by 44
Coding for Sequence Reconstruction for Single Edits
Cai, K., Kiah, H. M., Nguyen, T. T., & Yaakobi, E. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3122798 · Cited by 57
“iments (see for example, [5], [28]) as the current synthesis technologies are unable to sequence long codewords.”
BackgroundReading Information Stored in Synthetic Macromolecules
Soete, M., Mertens, C., Badi, N., & Prez, F. D. (2022) · Journal of the American Chemical Society · doi:10.1021/jacs.2c10316 · Cited by 42
Long-term preservation of big data: prospects of current storage technologies in digital libraries
Bhat, W. A. (2018) · Library Hi Tech · doi:10.1108/lht-06-2017-0117 · Cited by 49
Wang, Y., Noor‐A‐Rahim, M., Zhang, J., Gunawan, E., Guan, Y. L., & Poh, C. L. (2019) · Journal of Biological Engineering · doi:10.1186/s13036-019-0211-2 · Cited by 49
“The estimated density results are higher than the existing work [11, 13, 14]”
BackgroundMethodResultInfluentialLow-Bias Manipulation of DNA Oligo Pool for Robust Data Storage
Gao, Y., Chen, X., 郝建业, Zhang, C., Qiao, H., Ke, Y., & Qi, H. (2020) · ACS Synthetic Biology · doi:10.1021/acssynbio.0c00419 · Cited by 42
A Mixed Culture of Bacterial Cells Enables an Economic DNA Storage on a Large Scale
Hao, M., Qiao, H., Gao, Y., Wang, Z., Qiao, X., Chen, X., & Qi, H. (2020) · Communications Biology · doi:10.1038/s42003-020-01141-7 · Cited by 41
“The thermocycling protocol was: (1) 98 °C for 5 min, (2) 98 °C for 30 s, (3)54 °C for 30 s, (4) 72 °C for 10 s, then repeat steps 2–4 five times, followed by a final elongation at 72 °C for 5 min.”
MethodReading and Writing Digital Information in TNA
Yang, K., McCloskey, C. M., & Chaput, J. C. (2020) · ACS Synthetic Biology · doi:10.1021/acssynbio.0c00361 · Cited by 41
An outlook on the current challenges and opportunities in DNA data storage
Raza, M. H., Desai, S. S., Aravamudhan, S., & Zadegan, R. M. (2023) · Biotechnology Advances · doi:10.1016/j.biotechadv.2023.108155 · Cited by 44
A digital twin for DNA data storage based on comprehensive quantification of errors and biases
Gimpel, A. L., Stark, W. J., Heckel, R., & Grass, R. N. (2023) · Nature Communications · doi:10.1038/s41467-023-41729-1 · Cited by 55
“Comparisonshownofef fi ciencydistributionsbetweenour experiments, the deep ampli fi cation performed by Erlich et al. 6 , the bias experiment by Chen et al. 21 , and the bunny experiments by Koch et al. 23 .”
BackgroundMethodInfluentialBridging data-capacity gap in big data storage
Bhat, W. A. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.12.066 · Cited by 46
“This results into a huge areal density of the order of tens of Pbpsi that far exceeds the areal density of magnetic and flash storage technology.”
InfluentialCai, P., & Zhang, Y. (2020) · Intelligent and Converged Networks · doi:10.23919/icn.2020.0006 · Cited by 47
“Fountain codes also display superior performance in data storage[82] and data distribution[83] scenarios.”
BackgroundSzweda, R., Tschopp, M., Félix, O., Decher, G., & Lutz, J. (2018) · Angewandte Chemie International Edition · doi:10.1002/anie.201810559 · Cited by 42
An Intelligent Optimization Algorithm for Constructing a DNA Storage Code: NOL-HHO
Yin, Q., Cao, B., Li, X., Wang, B., Zhang, Q., & Wei, X. (2020) · International Journal of Molecular Sciences · doi:10.3390/ijms21062191 · Cited by 44
“…. . b n ), this constraint is defined as follows by Equation (1): • GC-content constraint The GC-content constraint [32] in a q ( n , M , d ) set typically requires that the total content of bases G or C be 50% of the code length n, as a constant GC-content maintains the stability of a DNA sequence.”
BackgroundMethodData storage using peptide sequences
Ng, C. C. A., Tam, W. M., Yin, H., Wu, Q., So, P.-K., Wong, M. Y.-M., Lau, F. C. M., & Yao, Z.-P. (2021) · Nature Communications · doi:10.1038/s41467-021-24496-9 · Cited by 41
Reconstruction algorithms for DNA-storage systems
Sabary, O., Yucovich, A., Shapira, G., & Yaakobi, E. (2024) · Scientific Reports · doi:10.1038/s41598-024-51730-3 · Cited by 70
“In this section we present the results of the tested algorithms on data from previous DNA storage experiments [20, 24, 40].”
InfluentialDigital Barcodes for High-Throughput Screening
Yang, Z. R., Chen, J., Xiao, Y., Yang, C., Zhao, C., Chen, D., & Weitz, D. A. (2024) · Chem & Bio Engineering · doi:10.1021/cbe.3c00085 · Cited by 43
Amalian, J., Ouahabi, A. A., Cavallo, G., König, N. F., Poyer, S., Lutz, J., & Charles, L. (2017) · Journal of Mass Spectrometry · doi:10.1002/jms.3947 · Cited by 41
“Use of artificial DNA to write intentional messages on nucleic acid chains was recently demonstrated,([1-4]) after pioneering works by Church and co-workers who reported a full biology text-book written with chains of 100-150 repeating units.”
BackgroundAnchor-Based Correction of Substitutions in Indexed Sets
Lenz, A., Siegel, P. H., Wachter-Zeh, A., & Yaakobi, E. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849523 · Cited by 41
“It is observed that the sequencing error rates at the beginning of DNA strands are lower with several sequencing technologies [5], [8], [12].”
BackgroundDual sequence definition increases the data storage capacity of sequence-defined macromolecules
Wetzel, K. S., Frölich, M., Solleder, S. C., Nickisch, R., Treu, P., & Meier, M. A. R. (2020) · Communications Chemistry · doi:10.1038/s42004-020-0308-z · Cited by 43
Clover: tree structure-based efficient DNA clustering for DNA-based data storage
Qu, G., Yan, Z., & Wu, H. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac336 · Cited by 48
Scalable and robust DNA-based storage via coding theory and deep learning
Bar-Lev, D., Orr, I., Sabary, O., Etzion, T., & Yaakobi, E. (2025) · Nature Machine Intelligence · doi:10.1038/s42256-025-01003-z · Cited by 98
“To examine and compare the accuracy and performance of the DNA-former, we used both of our datasets, Illumina and Nanopore (termed after the sequencing technology used), as well as four additional publicly available datasets 7,13,15,16 .”
InfluentialOptimized Code Design for Constrained DNA Data Storage With Asymmetric Errors
Li Juan, D. E. N. G., Wang, Y., Noor‐A‐Rahim, M., Guan, Y. L., Shi, Z., Gunawan, E., & Poh, C. L. (2019) · IEEE Access · doi:10.1109/access.2019.2924827 · Cited by 46
“It has been discussed in [2], the mapping potential is reduced to 1.”
InfluentialFundamental energy cost of finite-time parallelizable computing
Konopik, M., Korten, T., Lutz, E., & Linke, H. (2023) · Nature Communications · doi:10.1038/s41467-023-36020-2 · Cited by 51
“At the same time, massively parallel computers can be realized in biological computing, such as DNA computing [32–34] or network-based biocomputing (NBC) [35, 36], which use small DNA molecules or cytoskeletal filaments, respectively, as computing cores and memory.”
BackgroundA primordial DNA store and compute engine
Lin, K. N., Volkel, K., Cao, C., Hook, P. W., Polak, R. E., Clark, A. S., San‐Miguel, A., Timp, W., Tuck, J. M., Velev, O. D., et al. (2024) · Nature Nanotechnology · doi:10.1038/s41565-024-01771-6 · Cited by 47
SOLQC: Synthetic Oligo Library Quality Control tool
Sabary, O., Orlev, Y., Shafir, R., Anavy, L., Yaakobi, E., & Yakhini, Z. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa740 · Cited by 38
On Coding Over Sliced Information
Sima, J., Raviv, N., & Bruck, J. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3063709 · Cited by 51
“The interest in DNA storage has increased dramatically in recent years, following a few successful prototype implementations [2], [4], [7], [17].”
BackgroundSequence-Encoded Macromolecules with Increased Data Storage Capacity through a Thiol-Epoxy Reaction
Soete, M., Mertens, C., Aksakal, R., Badi, N., & Prez, F. D. (2021) · ACS Macro Letters · doi:10.1021/acsmacrolett.1c00275 · Cited by 41
Design of Constraint Coding Sets for Archive DNA Storage
Yin, Q., Zheng, Y., Wang, B., & Zhang, Q. (2021) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2021.3127271 · Cited by 43
“[22] used a robust fountain code to design and decode different types of files of 2.”
MethodMolecular access to multi-dimensionally encoded information
Steinkoenig, J., Aksakal, R., & Prez, F. D. (2019) · European Polymer Journal · doi:10.1016/j.eurpolymj.2019.109260 · Cited by 36
From Nano-Communications to Body Area Networks: A Perspective on Truly Personal Communications
Kułakowski, P., Turbić, K., & Correia, L. M. (2020) · IEEE Access · doi:10.1109/access.2020.3015825 · Cited by 38
“It was recently shown that information can be artificially stored and retrieved in DNA very efficiently, keeping on average 1.57 bits per nucleotide, which corresponds to an impressive density of 215 petabytes per gram of DNA [4].”
BackgroundInfluentialTrace Reconstruction Problems in Computational Biology
Bhardwaj, V., Pevzner, P. A., Rashtchian, C., & Safonova, Y. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3030569 · Cited by 43
“ternative synthesis schemes [52], [53], improved density and robustness using codes [27], [44], [54]–[66], and more realistic error models and fundamental limits [16], [67]–[70].”
BackgroundDNA-Based Molecular Computing, Storage, and Communications
Liu, Q., Yang, K., Xie, J., & Sun, Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3083663 · Cited by 42
Schaudy, E., Lietard, J., & Somoza, M. M. (2021) · ACS Synthetic Biology · doi:10.1021/acssynbio.1c00142 · Cited by 39
Genomic Encryption of Digital Data Stored in Synthetic DNA
Grass, R. N., Heckel, R., Dessimoz, C., & Stark, W. J. (2020) · Angewandte Chemie International Edition · doi:10.1002/anie.202001162 · Cited by 34
Mobile and Self‐Sustained Data Storage in an Extremophile Genomic DNA
Sun, F., Dong, Y., Ni, M., Ping, Z., Sun, Y., Ouyang, Q., & Qian, L. (2023) · Advanced Science · doi:10.1002/advs.202206201 · Cited by 38
Digital data storage on DNA tape using CRISPR base editors
Sadremomtaz, A., Glass, R. F., Guerrero, J. E., LaJeunesse, D., Josephs, E. A., & Zadegan, R. M. (2023) · Nature Communications · doi:10.1038/s41467-023-42223-4 · Cited by 43
“We synthesized DNA tape registers in bacteria en-masse, therefore DMOS has the potential to bypasses some challenges of conventional DNA based data storage including generation of toxic wastes, scalability, editability, and rewritability.(23-30) E.”
MethodSemina Aeternitatis: Using Bacteria for Tangible Interaction with Data
Alistar, M., & Pevere, M. (2020) · CHI Conference Extended Abstracts on Human Factors in Computing Systems (CHI EA) · doi:10.1145/3334480.3381817 · Cited by 49
“In this work, we use a DNA encoding technique that has proved effective for long-term data storage because of its extremely high packing density (215 petabytes per gram of DNA [7]).”
MethodPromiscuous molecules for smarter file operations in DNA-based data storage
Tomek, K. J., Volkel, K., Indermaur, E. W., Tuck, J. M., & Keung, A. J. (2021) · Nature Communications · doi:10.1038/s41467-021-23669-w · Cited by 46
Fractal construction of constrained code words for DNA storage systems
Löchel, H. F., Welzel, M., Hattab, G., Hauschild, A.-C., & Heider, D. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab1209 · Cited by 34
Li, X., Chen, M., & Wu, H. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac484 · Cited by 42
Kohman, R. E., Kunjapur, A. M., Hysolli, E., Wang, Y., & Church, G. M. (2018) · Angewandte Chemie International Edition · doi:10.1002/anie.201707976 · Cited by 33
Novel combinatorial coding results for DNA sequencing and data storage
Schoeny, C., Sala, F., & Dolecek, L. (2017) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2017.8335392 · Cited by 37
“In fact, DNA offers a uniquely well-suited medium for archival storage [1]–[3].”
BackgroundGCNSA: DNA storage encoding with a graph convolutional network and self-attention
Cao, B., Wang, B., & Zhang, Q. (2023) · iScience · doi:10.1016/j.isci.2023.106231 · Cited by 36
“It was used by Erlich et al. 10 to improve the coding rate in DNA storage.”
MethodInfluentialXie, R., Zan, X., Chu, L., Su, Y., Xu, P., & Liu, W. (2023) · BMC Bioinformatics · doi:10.1186/s12859-023-05237-9 · Cited by 32
Purification of multiplex oligonucleotide libraries by synthesis and selection
Choi, H., Choi, Y., Choi, J., Lee, A. C., Yeom, H., Hyun, J., Ryu, T., & Kwon, S. (2022) · Nature Biotechnology · doi:10.1038/s41587-021-00988-3 · Cited by 32
Survey 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 57
“In [10], Erlich and Zielinski proposed the use of fountain codes, screening the DNA oligos for homopolymer runs of no more than 3 nucleotides and GC -content in the 45% to 55% range.”
BackgroundMethodPreservation of DNA for Data Storage
Tan, X., Ge, L., Zhang, T., & Lu, Z. (2021) · Russian Chemical Reviews · doi:10.1070/rcr4994 · Cited by 31
Sequencing Coverage Analysis for Combinatorial DNA-Based Storage Systems
Preuss, I., Galili, B., Yakhini, Z., & Anavy, L. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3408053 · Cited by 51
“The inner and outer code approach is common in DNA-based storage literature [4], [5], [19], [20].”
BackgroundA Content-Addressable DNA Database with Learned Sequence Encodings
Stewart, K., Chen, Y.-J., Ward, D., Liu, X., Seelig, G., Strauß, K., & Ceze, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-00030-1_4 · Cited by 34
“DNA-based databases were first proposed over twenty years ago by Baum [3], yet recent demonstrations of their practicality [4, 6, 8, 9, 18, 28] have generated a renewed interest into researching related theory and applications.”
BackgroundRates of DNA Sequence Profiles for Practical Values of Read Lengths
Chang, Z., Chrisnata, J., Ezerman, M. F., & Kiah, H. M. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2747557 · Cited by 34
Design considerations for advancing data storage with synthetic DNA for long-term archiving
Ezekannagha, C., Becker, A., Heider, D., & Hattab, G. (2022) · Materials Today Bio · doi:10.1016/j.mtbio.2022.100306 · Cited by 36
“In this way, the storage density was improved by 24% compared to Erlich's earlier work [22].”
BackgroundMethodResultInfluentialThe DNA Storage Channel: Capacity and Error Probability Bounds
Weinberger, N., & Merhav, N. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3176371 · Cited by 59
Improving error-correcting capability in DNA digital storage via soft-decision decoding
Ding, L., Wu, S., Hou, Z., Li, A., Xu, Y., Feng, H., Pan, W., & Ruan, J. (2023) · National Science Review · doi:10.1093/nsr/nwad229 · Cited by 28
“Erlich et al. combined RS code with a type of ECC approaching Shannon capacity theoretically, called Fountain code, for high information density [ 4 ].”
BackgroundMethodInfluentialHow close are we to storing data in DNA?
Gervásio, J. H. D. B., Oliveira, H. D. C., Costa-Martins, A. G., Pesquero, J. B., Verona, B. M., & Cerize, N. N. P. (2023) · Trends in biotechnology · doi:10.1016/j.tibtech.2023.08.001 · Cited by 37
“Cell Disk” DNA Storage System Capable of Random Reading and Rewriting
Hou, Z., Qiang, W., Wang, X., Chen, X., Hu, X., Han, X., Shen, W., Zhang, B., Peng, X., Shi, W., et al. (2024) · Advanced Science · doi:10.1002/advs.202305921 · Cited by 32
Encoding information in synthetic metabolomes
Kennedy, E., Arcadia, C. E., Geiser, J. D., Weber, P. M., Rose, C., Rubenstein, B. M., & Rosenstein, J. K. (2019) · PLoS ONE · doi:10.1371/journal.pone.0217364 · Cited by 32
Application of DNA sequences in anti-counterfeiting: Current progress and challenges
Sharief, S. A., Chahal, P., & Alocilja, E. C. (2021) · International Journal of Pharmaceutics · doi:10.1016/j.ijpharm.2021.120580 · Cited by 33
Concatenated Codes for Multiple Reads of a DNA Sequence
Maarouf, I., Lenz, A., Welter, L., Wachter-Zeh, A., Rosnes, E., & Amat, A. G. I. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3206527 · Cited by 48
“Here, we do not extend the inner code optimization to the convolutional code, but rather pick the same code as in [48], which is the one corresponding to the generator polynomial g = [5, 7]oct.”
BackgroundPrinciples of Information Storage in Small-Molecule Mixtures
Rosenstein, J. K., Rose, C., Reda, S., Weber, P. M., Kim, E., Sello, J. K., Geiser, J. D., Kennedy, E., Arcadia, C. E., Dombroski, A., et al. (2020) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2020.2977304 · Cited by 34
“Using tools developed for modern genomics, researchers have synthesized complex pools of oligomers representing hundreds of megabytes of text, images, videos, and other media files, and retrieved the data using commercial high-throughput sequencing instruments [4, 12,18,22,23,35].”
MethodMetastable hybridization-based DNA information storage to allow rapid and permanent erasure
Kim, J., Bae, J. H., Baym, M., & Zhang, D. Y. (2020) · Nature Communications · doi:10.1038/s41467-020-18842-6 · Cited by 29
Survey of Information Encoding Techniques for DNA
Heinis, T., Sokolovskii, R., & Alnasir, J. J. (2023) · ACM Computing Surveys · doi:10.1145/3626233 · Cited by 43
“9 DNA Fountain Enables a Robust and Efficient Storage Architecture [22]”
BackgroundMethodInfluentialConcepts and Application of DNA Origami and DNA Self-Assembly: A Systematic Review
Liu, W., Duan, H., Zhang, D., Zhang, X., Luo, Q., Xie, T., Yan, H., Peng, L., Hu, Y., Li, L., et al. (2021) · Applied Bionics and Biomechanics · doi:10.1155/2021/9112407 · Cited by 39
“Previous studies have found that the data storage capacity per gram of DNA reaches 215PB, equivalent to that of 220,000 1TB hard drives [22].”
BackgroundHigh-scale random access on DNA storage systems
El-Shaikh, A., Welzel, M., Heider, D., & Seeger, B. (2022) · NAR Genomics and Bioinformatics · doi:10.1093/nargab/lqab126 · Cited by 29
“To obtain stable DNA, we have to consider the following biochemical constraints (7,13):”
BackgroundScaling logical density of DNA storage with enzymatically-ligated composite motifs
Yan, Y., Pinnamaneni, N., Chalapati, S., Crosbie, C., & Appuswamy, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-43172-0 · Cited by 36
K-Means Multi-Verse Optimizer (KMVO) Algorithm to Construct DNA Storage Codes
Cao, B., Zhao, S., Li, X., & Wang, B. (2020) · IEEE Access · doi:10.1109/access.2020.2970838 · Cited by 34
“If people want to store and utilize more information, they need denser, less costly storage media [2].”
BackgroundPreservation and Encryption in DNA Digital Data Storage
Zhang, Y., Ren, Y., Liu, Y., Wang, F., Zhang, H., & Liu, K. (2022) · ChemPlusChem · doi:10.1002/cplu.202200183 · Cited by 28
On Coding for an Abstracted Nanopore Channel for DNA Storage
Hulett, R., Chandak, S., & Wootters, M. K. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518236 · Cited by 32
The visual story of data storage: From storage properties to user interfaces
Anžel, A., Heider, D., & Hattab, G. (2021) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2021.08.031 · Cited by 37
“, fountain codes [69], forward error correction [83], Reed-Solomon codes [67]).”
A robust and efficient DNA storage architecture based on modulation encoding and decoding
Zan, X., Xie, R., Yao, X., Xu, P., & Liu, W. (2022) · doi:10.1101/2022.05.25.490755 · Cited by 27
“DNA Fountain 22 , 8 and inner-outer code were proved to be an effective way to overcome this issue.”
BackgroundMethodEfficient data reconstruction: The bottleneck of large-scale application of DNA storage
Cao, B., Zheng, Y., Shao, Q., Liu, Z., Xie, L., Zhao, Y., Wang, B., Zhang, Q., & Wei, X. (2024) · Cell Reports · doi:10.1016/j.celrep.2024.113699 · Cited by 38
A mirror-image protein-based information barcoding and storage technology
Zheng, J., Liang, J., Shi, W., Li, Y., Hu, H., Tian, C., & Liu, L. (2021) · 中国科学通报:英文版 · doi:10.1016/j.scib.2021.03.010 · Cited by 27
A brief review on DNA storage, compression, and digitalization
Cevallos, Y., Nakano, T., Tello-Oquendo, L., Rushdi, A. A., Inca, D., Santillán, I., Shirazi, A. Z., & Samaniego, N. (2021) · Nano Communication Networks · doi:10.1016/j.nancom.2021.100391 · Cited by 32
Yan, Z., Liang, C., & Wu, H. (2022) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2022.3225570 · Cited by 28
de Paz, A. M., Cybulski, T. R., Marblestone, A. H., Zamft, B. M., Church, G. M., Boyden, E. S., Kording, K. P., & Tyo, K. E. J. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky296 · Cited by 34
“DNA polymerases with specified fidelity responses could be developed for applications including but not limited to DNA data storage (59), molecular recording (28), random mutagenesis (60) and DNA/RNA sequencing (53,61).”
BackgroundSequence-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 37
Benerjee, K. G., Deb, S., & Gupta, M. K. (2020) · Cryptography and Communications · doi:10.1007/s12095-020-00459-7 · Cited by 29
Shomorony, I., & Vahid, A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3120920 · Cited by 41
“These include DNA synthesis constraints such as sequence composition [6, 21, 22], the asymmetric nature of the DNA sequencing error channel [23], the need for codes that correct insertion errors [24], and the need for techniques to allow random access [22].”
MethodMoglianetti, M., Pedone, D., Morerio, P., Scarsi, A., Donati, P. P., Bustreo, M., Bue, A. D., & Pompa, P. P. (2022) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.2c02995 · Cited by 27
Shinkar, T., Yaakobi, E., Lenz, A., & Wachter-Zeh, A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/isit.2019.8849737 · Cited by 25
“[1], [2], [5], [13], [18].”
Decoding DNA data storage for investment
Stanley, P. M., Strittmatter, L. M., Vickers, A., & Lee, K. C. K. (2020) · Biotechnology Advances · doi:10.1016/j.biotechadv.2020.107639 · Cited by 24
Enhancing Physical and Thermodynamic Properties of DNA Storage Sets With End-Constraint
Wu, J., Zheng, Y., Wang, B., & Zhang, Q. (2021) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2021.3121278 · Cited by 27
“In 2017, Erlich and Zielinski [16] put forward the fountain coding method.”
MethodEmpowering DNA-Based Information Processing: Computation and Data Storage
Li, K., Chen, H., Li, D., Yang, C. J., Zhang, H., & Zhu, Z. (2024) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.4c13948 · Cited by 26
Gotovtsev, P. M. (2020) · Applied Sciences · doi:10.3390/app10113990 · Cited by 27
“Living matter is able to provide There are already existing approaches to the storage of non-biological data in DNA [103–106]. effective data storage and operation inside the cell using DNA The ability to encapsulate DNA molecules in silica beads, which in turn can be put in polymeric systems for…”
BackgroundNOREC4DNA: using near-optimal rateless erasure codes for DNA storage
Schwarz, P. M., & Freisleben, B. (2021) · BMC Bioinformatics · doi:10.1186/s12859-021-04318-x · Cited by 25
“Erlich and Zielinski [4] have shown that using a Reed–Solomon code to check integrity and repair errors increases the number of correct packets even if small mutations occur.”
MethodInfluentialA Hierarchical Error Correction Strategy for Text DNA Storage
Zan, X., Yao, X., Xu, P., Chen, Z., Xie, L., Li, S., & Liu, W. (2021) · Interdisciplinary Sciences Computational Life Sciences · doi:10.1007/s12539-021-00476-x · Cited by 24
Recording Temporal Signals with Minutes Resolution Using Enzymatic DNA Synthesis
Bhan, N., Callisto, A., Strutz, J., Glaser, J. I., Kalhor, R., Boyden, E. S., Church, G. M., Kording, K. P., & Tyo, K. E. J. (2021) · Journal of the American Chemical Society · doi:10.1021/jacs.1c07331 · Cited by 24
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.