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
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 401–500 of 894
DNA Origami Framework‐Based Spatial Nanochip for Circular ssDNA Assembly and Data Storage
Wang, S., Yang, D., Li, J., Bao, H., Pan, S., Huang, K., Shao, J., Yang, Q., Chen, X., Jiang, X., et al. (2025) · Small · doi:10.1002/smll.202410391 · Cited by 9
Cao, B., Li, X., Wang, B., He, T., Zheng, Y., Zhang, X., & Zhang, Q. (2025) · Patterns · doi:10.1016/j.patter.2025.101288 · Cited by 14
“Although RS error-correcting codes were introduced in Erlich’s work 10 by adding redundancy, RS and other error-correcting codes have certain limitations in their error-handling ability.”
InfluentialRFS-codec: A Novel Encoding Approach to Store Image Data in DNA
Rasool, A. (2025) · Journal of Artificial Intelligence in Bioinformatics · doi:10.62762/jaib.2025.146324 · Cited by 8
Yan, Z., Qu, G., Chen, X., Zheng, G., & Wu, H. (2025) · Nature Communications · doi:10.1038/s41467-025-64230-3 · Cited by 13
Hierarchical core–shell DNA condensates enable programmable information storage and encryption
Chu, L., Wan, L., Wang, H., Wang, P., Deng, L., Gao, Y., Guo, P., He, L., & Han, D. (2025) · Nature Communications · doi:10.1038/s41467-025-67093-w · Cited by 14
Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
Beeri, N., & Schwartz, M. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3152392 · Cited by 8
Digital Preservation with Synthetic DNA
Marinelli, E., Ghabach, E., Yan, Y., Bolbroe, T., Sella, O., Heinis, T., & Appuswamy, R. (2022) · Lecture notes in computer science · doi:10.1007/978-3-662-66111-6_5 · Cited by 8
“In project OligoArchive [2], we are exploring a radically new storage media that has received a lot of attention recently—Deoxyribo Nucleic Acid (DNA) [6, 13, 9, 16].”
MethodAutomated routing of droplets for DNA storage on a digital microfluidics platform
Manicka, A., Stephan, A., Chari, S., Mendonsa, G., Okubo, P., Stolzberg-Schray, J., Reddy, A., & Riedel, M. D. (2023) · Digital Discovery · doi:10.1039/d3dd00083d · Cited by 8
Weindel, F., Gimpel, A. L., Grass, R. N., & Heckel, R. (2023) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton58177.2023.10313494 · Cited by 17
“Let us consider a linear growth model for the error probabilities p k , i.e., where α ≥ 0 is a growth factor and p is a base error probability set to 1% (substitution probabilities of current DNA storage systems [1, 15, 17, 18] lie between 0 .”
BackgroundZhang, X., & Zhou, F. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3356522 · Cited by 11
“In 2017, Erlich and Zielinski [16] proposed a DNA Fountain algorithm based on Luby Transform code, which filters out DNA sequences that do not satisfy the constraints through a filtering mechanism.”
MethodXu, Y., Ding, L., Wu, S., & Ruan, J. (2024) · Advanced Science · doi:10.1002/advs.202402951 · Cited by 8
Heckel, R. (2018) · Nature Biotechnology · doi:10.1038/nbt.4093 · Cited by 8
Digital Signatures to Ensure the Authenticity and Integrity of Synthetic DNA Molecules
Kar, D. M., Ray, I., Gallegos, J. E., & Peccoud, J. (2018) · New Security Paradigms Workshop · doi:10.1145/3285002.3285007 · Cited by 8
“have been developed to store the content of a book, an operating system, and even a movie in synthetic DNA [1, 2].”
BackgroundThe Data Center Industrial Complex
Hogan, M. (2021) · Duke University Press eBooks · doi:10.1215/9781478013044-017 · Cited by 10
Sequence Reconstruction Under Stutter Noise in Enzymatic DNA Synthesis
Shafir, R., Sabary, O., Anavy, L., Yaakobi, E., & Yakhini, Z. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw48936.2021.9611362 · Cited by 7
“This was demonstrated in studies covering a variety of encoding schemes, sequencing technologies, and data access capabilities [1, 4, 6, 8, 12, 13, 29, 30].”
BackgroundRecovery of Information Stored in Modified DNA with an Evolved Polymerase
Shroff, R., Ellefson, J. W., Wang, S. S., Boulgakov, A. A., Hughes, R. A., & Ellington, A. D. (2022) · ACS Synthetic Biology · doi:10.1021/acssynbio.1c00575 · Cited by 8
Bar-Lev, D., Marcovich, S., Yaakobi, E., & Yehezkeally, Y. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834766 · Cited by 10
Towards effective visual information storage on DNA support
Secilmis, L., Testolina, M., Lazzarotto, D. N., & Ebrahimi, T. (2022) · SPIE Applications of Digital Image Processing · doi:10.1117/12.2636678 · Cited by 10
Low-Redundancy Codes for Correcting Multiple Short-Duplication and Edit Errors
Tang, Y., Wang, S., Lou, H., Gabrys, R., & Farnoud, F. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3233733 · Cited by 9
“In particular, experiments in [3], [5], [6], [7], [8], and [9] demonstrate that data can be stored on and subsequently”
BackgroundRBS: A Rotational Coding Based on Blocking Strategy for DNA Storage
Mu, Z., Cao, B., Wang, P., Wang, B., & Zhang, Q. (2023) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2023.3254514 · Cited by 8
The Biological as a Double Limit for Artificial Intelligence: Review and Futuristic Debate
Țugui, A., Dănciulescu, D., & Subtirelu, M.-S. (2019) · International Journal of Computers Communications & Control · doi:10.15837/ijccc.2019.2.3536 · Cited by 8
“A practical achievement of great importance in the field of bio computers was the research study completed in 2016 by Erlich and Zielinski [19], researchers at Columbia University and the New York Genome Center, who informed the scientific community about a major improvement in DNA information storage and retrieval wh…”
BackgroundParallelized Linear Classification with Volumetric Chemical Perceptrons
Arcadia, C. E., Tann, H., Dombroski, A., Ferguson, K., Chen, S. L., Kim, E., Rose, C., Rubenstein, B. M., Reda, S., & Rosenstein, J. K. (2018) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2018.8638627 · Cited by 8
“based data storage [8], [9], [10], we anticipate that methods of processing chemically stored information will become increasingly relevant.”
MethodDNA information storage for audio and video files
-, W. C., Gang, H., Li, B., Ye, Y., & Yuan, Y. (2019) · Scientia Sinica Vitae · doi:10.1360/ssv-2019-0211 · Cited by 8
DNA Logic Multiplexing Using Toehold-Mediated Strand Displacement
Chen, C., Wang, H., Zhu, E., Shi, X., & Xu, J. (2020) · IEEE Access · doi:10.1109/access.2020.2989444 · Cited by 8
“Watson-Crick base-pairing provides the foundation for biocomputing [8]–[9], information storage [10]–[11], synthetic biology [12], etc.”
BackgroundChandak, 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. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2019.12.20.871939 · Cited by 8
Chamaeleo: a robust library for DNA storage coding schemesPreprint
Ping, Z., Zhang, H., Chen, S., Zhuang, Q., Zhu, S. J., & Shen, Y. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.01.02.892588 · Cited by 9
“DNA Fountain [8] scheme, which is based on LT code, improves the coding efficiency and applies screening steps to restrict the occurrence of homopolymer and limit GC content.”
BackgroundMethodInfluentialThe DNA Storage Channel: Capacity and Error ProbabilityPreprint
Weinberger, N., & Merhav, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.12549 · Cited by 8
An Information Theory for Out-of-Order Media With Applications in DNA Data Storage
Ravi, A. N., Vahid, A., & Shomorony, I. (2024) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2024.3403759 · Cited by 8
“Concurrent research efforts have been dedicated to developing explicit codes catering to DNA storage specifics, addressing synthesis constraints [33], [34], [44], asymmetric sequencing errors [45], insertion error correction [46] and deletion error correction [47].”
BackgroundBiotechnological tools boost the functional diversity of DNA-based data storage systems
Xu, X., Wang, W., & Ping, Z. (2025) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2025.02.002 · Cited by 11
“High-fidelity and high-throughput sequencing platforms provide efficient and cost-effective methods for retrieving stored data while simultaneously minimizing errors and improving the processing speed [49].”
Pradhan, J., & Nenavath, H. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3540102 · Cited by 8
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems
Boruchovsky, A., Bar-Lev, D., & Yaakobi, E. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3559684 · Cited by 7
“Since then, together with the developments in synthesis and sequencing technologies, more research groups showed the potential of in vitro DNA storage; see e.g. [1]–[4], [7], [12], [19], [20].”
Advancing DNA and RNA Modification Detection via Nanopore Sequencing
He, B., Fan, Y., Liu, J., Chen, Y., Yang, J., Xiang, H., Peng, J., & Yi, C. (2025) · ACS Nano · doi:10.1021/acsnano.5c11784 · Cited by 7
Approaching single-molecule assembly-free readout from medium-length encoded DNA
Chen, W., Qin, R., Guo, Q., Guo, J., Ge, Q., & Yuan, Y. (2025) · Nature Communications · doi:10.1038/s41467-025-65004-7 · Cited by 9
A DNA origami framework cryptosystem with nanoconfinement control of fluorescence logic permutations
Hou, X., Zhang, Y., Liu, Y., Xia, Q., Zhang, Y., Wang, J., Li, J., Wang, F., Wang, L., Liu, H., et al. (2025) · Science Advances · doi:10.1126/sciadv.aea7518 · Cited by 7
Towards high-density storage of text and images into DNA by the “Xiao-Pang” codec system
Lu, M., Wang, Y., Qiang, W., Cui, J., Wang, Y., Huang, X., & Dai, J. (2023) · Science China Life Sciences · doi:10.1007/s11427-022-2252-0 · Cited by 7
Efficient DNA-Based Image Coding and Storage
Ruan, C., Han, R., Li, Y., Gao, S., Wu, H., & Ling, N. (2023) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas46773.2023.10182162 · Cited by 12
“Inspired by DNA Fountain [17], we adopt LT codes [18] as the prototype but made several improvements.”
MethodDNA Merge-Sort: A Family of Nested Varshamov-Tenengolts Reassembly Codes for Out-of-Order Media
Nassirpour, S., Shomorony, I., & Vahid, A. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3335409 · Cited by 8
“DNA-based storage has the potential to provide information densities and information lifetimes far exceeding what is possible with state-of-the-art technologies [4], [6].”
BackgroundPermutation Capacity Region of Adder Multiple-Access Channels
Lu, W., & Makur, A. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3350436 · Cited by 7
“Another motivation for studying permutation channels arises from their relevance to DNA storage systems, which are attractive mediums for archival storage due to their high density and reliability over long periods of time [19], [20].”
BackgroundEfficient Explicit and Pseudo-Random Constructions of Constrained Codes for DNA Storage
He, X., Liu, Y., Wang, T., & Tang, X. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3455235 · Cited by 8
“Example 6: Consider the ( ϵ, ℓ ) -constrained RS code used in [3], where the RS code is over finite field GF(2 8 ) and encodes length-144 DNA strings into length-152 DNA strings (i.e., encode 36 RS symbols into 38 RS symbols).”
InfluentialEnzymes as green and sustainable tools for DNA data storage
Liu, X., Yu, E., Zhao, Q., Han, H., & Li, Q. (2025) · Chemical Communications · doi:10.1039/d4cc06351a · Cited by 7
Cracking the code on DNA storage
Greengard, S. (2017) · Communications of the ACM · doi:10.1145/3088493 · Cited by 7
A Survey Paper on DNA-Based Data Storage
Taluja, S., Bhupal, J., & Krishnan, S. R. (2020) · International Conference on Emerging Trends in Information Technology and Engineering (ICETITE) · doi:10.1109/ic-etite47903.2020.62 · Cited by 11
Wang, C., Liu, H., Wang, H., Tao, J., Yang, T., Chen, H., An, R., Wang, J., Huang, N., Gong, X., et al. (2020) · Bulletin of the Chemical Society of Japan · doi:10.1246/bcsj.20200201 · Cited by 7
Funktionelle Nukleinsäure‐Nanomaterialien: Entwicklung, Eigenschaften und Anwendungen
Xu, W., He, W., Du, Z., Zhu, L., Huang, K., Lu, Y., & Luo, Y. (2019) · Angewandte Chemie · doi:10.1002/ange.201909927 · Cited by 7
Lu, X., & Kim, S. (2021) · IEEE Access · doi:10.1109/access.2021.3116245 · Cited by 8
“To improve the robustness of the DNA synthesis and sequencing processes, error correction codes such as fountain codes [5], Reed-Solomon codes [7], BoseChaudhuri-Hocquenghem codes [8], and low-density paritycheck codes [8]–[10] have been applied to DNA storage systems.”
BackgroundMethodInfluentialAchieving the Capacity of a DNA Storage Channel with Linear Coding Schemes
Levick, K., Heckel, R., & Shomorony, I. (2022) · Conference on Information Sciences and Systems · doi:10.1109/ciss53076.2022.9751151 · Cited by 8
Integrating FPGA Acceleration in the DNAssim Framework for Faster DNA-Based Data Storage Simulations
Marelli, A., Chiozzi, T., Battistini, N., Zuolo, L., Micheloni, R., & Zambelli, C. (2023) · Electronics · doi:10.3390/electronics12122621 · Cited by 6
DNA-Correcting Codes: End-to-end Correction in DNA Storage Systems
Boruchovsky, A., Bar-Lev, D., & Yaakobi, E. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206536 · Cited by 7
“Since then, together with the developments in synthesis and sequencing technologies, more research groups showed the potential of in vitro DNA storage; see e.g. [1]–[4], [6], [11], [18], [19].”
Onoe, J., Noda, Y., Wang, Q., Harano, K., Nakaya, M., & Nakayama, T. (2024) · Science and Technology of Advanced Materials · doi:10.1080/14686996.2024.2346068 · Cited by 7
“Although the information density of DNA-based storage device is expected to be 10 5 times larger than that of HDD [72], essential digital operations such as DNA sequencing (encoding) and reading (decoding) is still impractical in time and costs [73].”
BackgroundRobust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions
Sima, J., Raviv, N., & Bruck, J. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3513040 · Cited by 8
“Prototype implementations of DNA storage stored 643KB data in [9] and 739KB data in [12] respectively, followed by many experiments [1], [2], [5], [6], [10], [29], [36], [37] that improved the storage data size.”
Advancing DNA Steganography with Incorporation of Randomness
Cui, M., & Zhang, Y. (2020) · ChemBioChem · doi:10.1002/cbic.202000149 · Cited by 9
High-density information storage and random access scheme using synthetic DNA
Zhang, S., Wu, J., Huang, B., & Liu, Y. (2021) · 3 Biotech · doi:10.1007/s13205-021-02882-w · Cited by 8
Encrypted Oligonucleotide Arrays for Molecular Authentication
Holden, M. T., & Smith, L. M. (2019) · ACS Combinatorial Science · doi:10.1021/acscombsci.9b00088 · Cited by 8
Run-Length Constraint of Cyclic Reverse-Complement and Constant GC-Content DNA Codes
Eldin, R. T., & Matsui, H. (2019) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2019eap1053 · Cited by 7
Role of Genomics in Smart Era and Its Application in COVID‐19
Kumar, S., & Bhowmik, B. R. (2023) · Wiley eBooks · doi:10.1002/9781394213726.ch4 · Cited by 7
Zeng, H., Mondal, M., Song, R., Zhang, J., Xia, B., Liu, M., Zhu, C., He, B., Gao, Y. Q., & Yi, C. (2018) · Angewandte Chemie International Edition · doi:10.1002/anie.201807845 · Cited by 11
High Fault-Tolerant DNA Image Storage System Based on VAE
Lu, Y., Zhang, Z., Yang, J., & Zhang, C. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3544401 · Cited by 7
“The binary data is then mapped to the four DNA bases, and DNA sequences are filtered to select those that meet specific criteria for data storage [14].”
Zhang, A., Wang, L.-J., Zhai, X., Xiao, Y., Wu, Y., Zhao, Y., Liu, K., Zheng, J., & Chen, D. (2025) · Advanced Science · doi:10.1002/advs.202503790 · Cited by 9
AoI-OptiIoBNT: Age of Information-Driven DNA-Based Internet of Bio-Nano Things Optimization
Cheng, W., Fu, J., Wang, Q., Yang, K., Chen, Y., & Sun, Y. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3566219 · Cited by 10
“To address the unique challenges of biochemical environments, YYC differs from conventional bit-level error correction benchmarks such as Repetition [34], Reed-Solomon (RS) [35], Fountain [36], and LDPC [37].”
Polymerase Elongation onto Patterned DNA for Random Accessed DNA Data Storage
Kang, T., Lim, D., Lee, W. J., & Song, Y. (2025) · BioChip Journal · doi:10.1007/s13206-025-00214-1 · Cited by 7
“For DNA synthesis, several DNA encoding algorithms have been developed to increase data capacity, synthesize stable oligos, and reduce reading error sequences [10–12].”
Exploring the intersection of natural sciences and information technology via entropy and randomness
Luescher, A. M., Heckel, R., & Grass, R. N. (2025) · Nature Communications · doi:10.1038/s41467-025-62353-1 · Cited by 13
DNA computing: DNA circuits and data storage
Xu, H., Yu, Y., Li, P.-X., Liu, S., Yan, X., Zhou, Z., & Tian, Y. (2025) · Nanoscale Horizons · doi:10.1039/d5nh00459d · Cited by 7
Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions
Nguyen, T. T., Wang, C., Cai, K., Zhang, Y., & Yakhini, Z. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195608 · Cited by 8
“Most literature experiments used DNA sequences whose GC - content is close to 50% , and the maximum run is of length at most six [4], [5], [12], [22].”
Li, X., Zheng, Y., Shao, Q., Wang, J., Li, W., Bin, W. A. N. G., Zhou, S., Cao, B., & Zheng, P. (2026) · Synthetic and Systems Biotechnology · doi:10.1016/j.synbio.2026.01.028 · Cited by 7
“In this paper, real-world DNA storage datasets reported by Erlich et al. [45], Organick et al. [22], Grass et al. [46] and Srinivasavaradhan et al. [47] were used to train the models.”
Combinatorial constraint coding based on the EORS algorithm in DNA storage
Xiaoru, L., & Ling, G. (2021) · PLoS ONE · doi:10.1371/journal.pone.0255376 · Cited by 9
“14 × 106-byte computer operating system, movies and other files and used Illumina sequencing to retrieve information [3].”
MethodRapid Information Retrieval from DNA Storage with Microfluidic Very Large‐Scale Integration Platform
Liu, D., & Cheow, L. F. (2023) · Small · doi:10.1002/smll.202309867 · Cited by 8
Data recovery methods for DNA storage based on fountain codes
Schwarz, P. M., & Freisleben, B. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.04.048 · Cited by 9
“Moreover, advanced inner codes can be deployed to detect and correct substitutions and indels up to a pre-defined threshold, and treat a packet as an erasure otherwise [48]. https://doi.org/10.1016/j.csbj.2024.04.048 Received 27 February 2024; Received in revised form 18 April 2024; Accepted 18…”
InfluentialRobust DNA Image Storage Decoding with Residual CNN
Ruan, C., Yang, L. H., Han, R., Gao, S., Wu, H., & Ling, N. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10558127 · Cited by 7
“Over the past decade, numerous efforts have focused on research on the use of DNA for digital file storage, with a key concern being how to apply nucleotides for data compression and encoding [6] [7] [8].”
BackgroundMethodEvaluating the risk of data loss due to particle radiation damage in a DNA data storage system
Takahashi, C. N., Ward, D., Cazzaniga, C., Frost, C. G., Rech, P., Ganguly, K., Blanchard, S. P., Wender, S., Nguyen, B. H., & Smith, J. A. (2024) · Nature Communications · doi:10.1038/s41467-024-51768-x · Cited by 9
Batch Optimization for DNA Synthesis
Makarychev, K., Rácz, M. Z., Rashtchian, C., & Yekhanin, S. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517820 · Cited by 5
Variable-position centrifugal platform achieves droplet manipulation and logic circuitries on-chip
Cai, G., Xu, F., Chen, B., Li, X., Huang, J., & Mi, S. (2022) · Lab on a Chip · doi:10.1039/d2lc00761d · Cited by 6
DNA Encoding-Based Nucleotide Pattern and Deep Features for Instance and Class-Based Image Retrieval
Pradhan, J., Pal, A. K., Islam, S. H., & Bhaya, C. (2023) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2023.3303512 · Cited by 6
“Erlich et al. [7] proposed a robust and efficient DNA data storage technique using Fountain coding.”
MethodDBTRG: De Bruijn Trim rotation graph encoding for reliable DNA storage
Zhao, Y., Cao, B., Wang, P., Wang, K., & Wang, B. (2023) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2023.09.004 · Cited by 7
“[20] proposed a fountain encoding scheme that segments binary files into droplets, and then they performed Luby transformation and screening to obtain DNA sequences that met certain conditions.”
InfluentialMolecular communication with DNA cellular storage system
Shah, S., Raghavachari, A., Lo, C., & Mărculescu, R. (2017) · ACM International Conference on Nanoscale Computing and Communication (NANOCOM) · doi:10.1145/3109453.3109467 · Cited by 6
“For example, DNA sequences can compactly and reliably store data with a density of up to 1 exabyte per cubic millimeter with a half life of over 500 years [7, 9, 17]; this is orders of magnitude above the capacities of traditional hardware.”
BackgroundVom Design der Moleküle des Lebens zum Design von Leben: Zukünftige Anwendungen von DNA‐Technologien
Kohman, R. E., Kunjapur, A. M., Hysolli, E., Wang, Y., & Church, G. M. (2018) · Angewandte Chemie · doi:10.1002/ange.201707976 · Cited by 6
Encoding scheme for data storage and retrieval on DNA computers
Sharma, D., Kumar, R., Gupta, M., & Saxena, T. (2020) · IET Nanobiotechnology · doi:10.1049/iet-nbt.2020.0157 · Cited by 6
An Asymmetric-Error-Aware LDPC Decoding Algorithm for DNA Storage
Sun, Y., Han, G., Liu, C., Wang, Y., & Fang, Y. (2022) · IEEE Communications Letters · doi:10.1109/lcomm.2022.3216408 · Cited by 8
“In order to design efficient error-correction solutions for DNA storage, classic error-correction channel codes such as fountain codes [2], Bose–Chaudhuri–Hocquenghem (BCH) codes [4] and Reed-Solomon (RS) codes [7] have been employed.”
BackgroundMethodSustainable Innovation for Open Hardware and Open Science – Lessons from The Hardware Hacker
Hsing, P. (2018) · Journal of Open Hardware · doi:10.5334/joh.11 · Cited by 6
“Indeed, the computerisation of biology is a growing field of academic research [13] and has produced the ability to store more than 200 petabytes of data in a single gram of DNA molecules [6].”
BackgroundOn Coding over Sliced InformationPreprint
Sima, J., Raviv, N., & Bruck, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.02716 · Cited by 6
“The interest in DNA storage has increased dramatically in recent years, following a few successful prototype implementations [2], [4], [7], [17].”
BackgroundTowards Chinese text and DNA shift encoding scheme based on biomass plasmid storage
Yang, X., Lai, L., Qiang, X., Deng, M. X., Xie, Y., Shi, X., & Kou, Z. (2023) · Frontiers in Bioinformatics · doi:10.3389/fbinf.2023.1276934 · Cited by 7
“In 2017, Erlich et al. introduced the “ DNA Fountain ” into the fi eld of DNA storage, a method with high information density, long-term stability, low storage costs, and ef fi ciency advantages (Erlich and Zielinski, 2017).”
BackgroundLiu, Q., Liu, Q., Zhang, J., Li, X., Qi, H., Li, Y., & Song, D. (2025) · Small · doi:10.1002/smll.202501720 · Cited by 7
ReLume: Enhancing DNA storage data reconstruction with flow network and graph partitioning
Xie, L., Cao, B., Wen, X., Zheng, Y., Wang, B., Zhou, S., & Zheng, P. (2025) · Methods · doi:10.1016/j.ymeth.2025.03.022 · Cited by 5
INNSE: Invertible neural network-based DNA image storage with self-correction encoding
Zheng, Y., Zhang, X., Sun, L., Cao, B., Wang, B., Zhang, Q., & Zheng, P. (2025) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2025.06.003 · Cited by 10
Tandon, A., Lee, J., Nam, Y., Seo, S., & Park, S. H. (2025) · Chemistry of Materials · doi:10.1021/acs.chemmater.5c00330 · Cited by 5
Electro-switchable addressing system for achieving repetitive random data access
Yu, H., Han, Y., Lin, W., Gao, H., Li, W., Lv, M., Cheng, M., Huang, Y., Bi, K., Lu, Z., et al. (2025) · Nucleic Acids Research · doi:10.1093/nar/gkaf733 · Cited by 5
“These attributes have led to the widespread recognition of artificially synthesized DNA within both technical and industrial communities as an ideal solution capable of addressing the challenges posed by data proliferation [ 3 ].”
Weindel, F., Gimpel, A. L., Grass, R. N., & Heckel, R. (2025) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2025.3610330 · Cited by 5
“…us now consider a linear growth model for the substitution rate p r : where r ∈ N , α ≥ 0 is a growth factor and p = p 1 is a base substitution rate set to 1%, consistent with the substitution probabilities of current DNA data storage systems that lie between 0.08% and 2.6% [2], [3], [13], [18].”
InfluentialConstrained coding for error mitigation in nanopore-based DNA data storage
Whritenour, K., Civelek, M., & Farnoud, F. (2025) · Scientific Reports · doi:10.1038/s41598-025-08531-z · Cited by 6
Catalytic DNA‐Assisted Mass Production of Arbitrary Single‐Stranded DNA
Zhang, Q., Xia, K., Jiang, M., Li, Q., Chen, W., Han, M., Li, W., Ke, R., Wang, F., Zhao, Y., et al. (2022) · Angewandte Chemie · doi:10.1002/ange.202212011 · Cited by 6
10 Years of Natural Data Storage
Limbachiya, D., Gupta, M. K., & Aggarwal, V. (2022) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2022.3211446 · Cited by 9
“are significantly more likely in regions with a high GC content [9].”
BackgroundInfluentialBig data management: from hard drives to DNA drives
Hamadani, A., Ganai, N. A., FAROOQ, S. F., & Bhat, B. A. (2020) · The Indian Journal of Animal Sciences · doi:10.56093/ijans.v90i2.98761 · Cited by 5
“jpg format 2017 (Erlich and Zielinski 2017) · Created 45,652 sequences of length of 120 nucleotides”
BackgroundHighly Accurate Sequence- and Position-Independent Error Profiling of DNA Synthesis and Sequencing
Yeom, H., Kim, N., Lee, A. C., Kim, J., Kim, H., Choi, H., Song, S. W., Kwon, S., & Choi, Y. (2023) · ACS Synthetic Biology · doi:10.1021/acssynbio.3c00308 · Cited by 9
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage
Hanna, S. K. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619614 · Cited by 8
DSI-ResCNN: A Framework Enhancing the Error-Tolerance Capacity of DNA Storage for Images
Ruan, C., Yang, L. H., Han, R., Gao, S., Wu, H., Yuan, Q., Guo, Y., & Ling, N. (2025) · IEEE Access · doi:10.1109/access.2025.3549673 · Cited by 8
“ResCNN and ResCNN+SDC demonstrate advantages in terms of low redundancy, error tolerance, and scalability compared to traditional approaches like DNA-Fountain coding [23], ECC-based designs [9], and strand overlapping with duplication and voting [10], [11].”
Dna-storalator: a computational simulator for DNA data storage
Chaykin, G., Sabary, O., Furman, N., Shabat, D. B., & Yaakobi, E. (2025) · BMC Bioinformatics · doi:10.1186/s12859-025-06222-0 · Cited by 9
Hilbert, L., Gadzekpo, A., Vecchio, S. L., Wellhäusser, M., Tschurikow, X., Prizak, R., Becker, B., Burghart, S., & Oprzeska‐Zingrebe, E. A. (2025) · Annals of the New York Academy of Sciences · doi:10.1111/nyas.15415 · Cited by 7
“21,22 These developments reveal a fundamental functional discrepancy between cellular processes that rely on genomic DNA and digital memory as used in electronic computers.”
Bee Identification Problem for DNA Strands
Chrisnata, J., Kiah, H. M., Vardy, A., & Yaakobi, E. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834414 · Cited by 5
Constrained Channel Capacity for DNA-Based Data Storage Systems
Fan, K., Wu, H., & Yan, Z. (2022) · IEEE Communications Letters · doi:10.1109/lcomm.2022.3212200 · Cited by 6
“On the k -RLL constraint, Erlich and Zielinski [2] used the probability to calculate the size of the set of valid codewords under this constraint.”
BackgroundMethodA possible mechanism of neural read-out from a molecular engram
Mollon, J. D., Danilova, M. V., & Zhuravlev, A. V. (2023) · Neurobiology of Learning and Memory · doi:10.1016/j.nlm.2023.107748 · Cited by 5
“The compactness of storage in synthetic DNA has independently been exploited in computer science: 1018 bytes of information can be stored in one cubic millimeter of DNA (Ceze et al., 2019; Erlich and Zielinski, 2017; Ezekannagha et al., 2022; Hao et al., 2021; Neiman, 1965; Stanley et al., 2020).”
BackgroundSequence Design and Reconstruction Under the Repeat Channel in Enzymatic DNA Synthesis
Shafir, R., Sabary, O., Anavy, L., Yaakobi, E., & Yakhini, Z. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3330848 · Cited by 6
Design of DNA Storage Coding Scheme With LDPC Codes and Interleaving
Kim, J.-W., Jeong, J., Kwak, H.-Y., & No, J. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3379976 · Cited by 8
“We compare four coding schemes ([25], [26], [27], and this work) and three sequencing results ( dataA , dataB in [26], and this work).”
BackgroundMethodResultInfluential
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.