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 601–700 of 894
An Efficient Joint Decoding Scheme for Outer Codes in DNA-Based Data Storage
Ding, Y., He, X., Cai, K., Song, G., Dai, B., & Tang, X. (2023) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/icccworkshops57813.2023.10233840 · Cited by 2
“Due to the increasing demand for data storage, DNAbased data storage systems have attracted significant attention, since they can achieve extremely high data storage capacity, with very long duration and low maintenance cost [1]–[4].”
BackgroundImage Storage on Synthetic DNA Using Compressive Autoencoders and DNA-Adapted Entropy Coders
Pic, X., Antonio, E. G. S., Dimopoulou, M., & Antonini, M. (2023) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp59012.2023.10337673 · Cited by 5
“In the same year, Erlich et al. presented a method based on Fountain codes, creating multiple oligos and discarding those violating biochemical constraints [13].”
MethodA Novel Microfluidic Strategy for DNA Data Random Access Via Droplet Digital PCR
Wang, D., Du, Y., Wang, N., Liu, Y., Luo, Y., & Zhao, J. (2024) · IEEE International Conference on Micro Electro Mechanical Systems (MEMS) · doi:10.1109/mems58180.2024.10439418 · Cited by 2
Constructions and decoding of GC-balanced codes for edit errors
Wu, K., & Liu, S. (2024) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2024.102391 · Cited by 3
Augmented LT codes over binary extension fields with increased ratio of full‐degree columns
Jiang, C., Cui, J., Li, J., & Guo, C. (2024) · Electronics Letters · doi:10.1049/ell2.13110 · Cited by 2
FCBC Hybrid Encoding Method Based on Fountain Code and Base64 Code
Monash, Y. W., Bia, K., & Zhaob, X. (2023) · International Conference on Electronic Information Engineering and Computer Communication (EIECC) · doi:10.1109/eiecc60864.2023.10456627 · Cited by 3
“Initially designed for erasing channels in the communication field [13-14], but after improvement, the Erlich [15] team was the first to use fountain codes for DNA storage.”
BackgroundLevenshtein Distance Embedding with Poisson Regression for DNA Storage
Wei, X., Guo, A. J. X., Sun, S., Wei, M., & Yu, W. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i14.29509 · Cited by 4
“This data 1 was originally provided by a research called DNA-Fountain (Erlich and Zielinski 2017), which is a milestone in DNA storage.”
MethodRepurposing Waste Chemicals for Sustainable and Durable Molecular Data Storage
gumus, S., Biechele-Speziale, D., Manz, K. E., Pennell, K. D., Rubenstein, B. M., & Rosenstein, J. K. (2024) · ACS Omega · doi:10.1021/acsomega.3c09234 · Cited by 2
Nwosu, A. U., Goyal, S. B., Rajawat, A. S., Kemat, B. B., & Mahmood, W. M. A. B. W. (2024) · CRC Press eBooks · doi:10.1201/9781003471059-24 · Cited by 2
DNA Storage Toolkit: A Modular End-to-End DNA Data Storage Codec and Simulator
Sharma, P., Goh, G. Y., Gao, B., Ou, L., Lin, D., Sharma, D., & Jevdjic, D. (2024) · IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) · doi:10.1109/ispass61541.2024.00023 · Cited by 5
“Many DNA storage architectures have been proposed, which leverage a large spectrum of available chemical tools to enable efficient and long-lasting data storage [5], [10], [12], [25], [39], [40].”
BackgroundSecret Sharing for DNA Probability Vectors
Zhang, W., & Wang, Z. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10623016 · Cited by 5
“Afterwards, the DNA samples are sequenced and decoded to retrieve the original information [1]– [7].”
‘Do-it-yourself’ data storage on DNA paves way to simple archiving system
Imburgia, C. E., & Nivala, J. (2024) · Nature · doi:10.1038/d41586-024-03312-6 · Cited by 2
Hernandez, S. I., Peccoud, S., Berezin, C.-T., & Peccoud, J. (2024) · Trends in biotechnology · doi:10.1016/j.tibtech.2025.03.010 · Cited by 3
Sequence analysis and decoding with extra low-quality reads for DNA data storage
Park, J., Jeon, H. H., Lee, J. W., & Park, H. (2025) · Bioinformatics · doi:10.1093/bioinformatics/btaf335 · Cited by 2
HybridFlow-DNA: A Deep Generative Compression Framework for DNA Storage of Images
Ruan, C., Han, R., Gao, S., Lü, L., Jiang, W., Wang, W., Wu, H., & Ling, N. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11044311 · Cited by 3
Next Generation Information Storage Technology: DNA Data Storage
Liu, S., Ye, Z., & Chen, M. (2020) · International Conference on Machine Learning and Computing (ICMLC) · doi:10.1145/3383972.3383999 · Cited by 2
MRC: A High Density Encoding Method for Pratical DNA-based Storage
Liu, Q., Wang, P., Cui, J., & Qi, H. (2020) · International Conference on Advanced Cloud and Big Data · doi:10.1109/cbd51900.2020.00012 · Cited by 4
“Several mechanisms [9] such as RS (Reed-Solomon) codes [8], fountain codes [6] have been adopted.”
BackgroundMethodSecret messaging with endogenous chemistry
Kennedy, E., Geiser, J. D., Arcadia, C. E., Weber, P. M., Rose, C., Rubenstein, B. M., & Rosenstein, J. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-92987-2 · Cited by 2
Selective Run-Length Constrained Encoding Scheme on Extended Nucleic Acid Memory
Biswas, S., Ghosh, T., & Nath, S. (2022) · IEEE VLSI Device Circuit and System (VLSI DCS) · doi:10.1109/vlsidcs53788.2022.9811440 · Cited by 2
“The comparison of the previously proposed works has been done concerning the average data density in bits/nucleotides as reported by their respective literature and their analysis found in some of the previously published research papers which are [16], [25], [26] and [27].”
ResultCorrecting multiple short duplication and substitution errors
Tang, Y., Wangy, S., Gabrysz, R., & Farnoud, F. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834571 · Cited by 2
Lietard, J., Schaudy, E., Hölz, K., Ameur, D., & Somoza, M. M. (2019) · Journal of Visualized Experiments · doi:10.3791/59936-v · Cited by 2
Fei, Z., Li, M., Cheng, C., Tan, G., & Xiao, P. (2022) · Nano Select · doi:10.1002/nano.202200168 · Cited by 2
RetractedLévesque, S. (2022) · Cygne noir · doi:10.7202/1089940ar · Cited by 2
Leveraging nature to advance data storage: DNA as a storage medium
Abram, K. Z., & Udaondo, Z. (2023) · Microbial Biotechnology · doi:10.1111/1751-7915.14291 · Cited by 4
“…storing information using DNA is not necessarily a new idea, it has remained largely theoretical since it was first mentioned by Richard P. Feynman in a lecture given at the annual meeting of the American Physical Society in 1959 at the California Institute of Technology (Caltech) (Feynman, 1960).”
BackgroundPardi-Tóth, V., Kuki, Á., Kordován, M. Á., Róth, G., Nagy, L., Zsuga, M., Nagy, T., & Kéki, S. (2023) · Scientific Reports · doi:10.1038/s41598-023-43658-x · Cited by 3
A Review of DNA Cryptography: From a Data Protection Perspective
Parmar, P., Gadhiya, J. A., Vats, S., Verma, D. K., & Vaghela, K. N. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10475078 · Cited by 2
“Survey: The research described a revolutionary approach to digital data encoding, storage, and retrieval utilizing DNA molecules and polar codes [19].”
A Thermodynamic Study on Information Power in Communication Systems
Yan, L., & Ge, X. (2024) · Entropy · doi:10.3390/e26080650 · Cited by 3
Hiding and Storing Messages and Data in DNA
Demidov, V. V. (2020) · Springer eBooks · doi:10.1007/978-3-030-36434-2_2 · Cited by 3
Blow, N. S. (2017) · BioTechniques · doi:10.2144/000114531 · Cited by 2
Genomic encryption of digital data stored in synthetic DNAPreprint
Grass, R. N., Heckel, R., Dessimoz, C., & Stark, W. J. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/831883 · Cited by 2
Low-Bias Amplification for Robust DNA Data ReadoutPreprint
Gao, Y., Chen, X., Hao, J., Zhang, C., Qiao, H., Ke, Y., & Qi, H. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.02.09.940411 · Cited by 2
“The smallness and the unevenness of DNA copy 43 numbers cause a serious problem for DNA sequence retrieval and data decoding(5, 12, 13).”
BackgroundMethodInfluentialLa révolution de l’ADN : biocompatible and biosafe DNA data storagePreprint
Maes, A., Peillet, J. L., Julienne, A., Blachon, C., Cornille, N., Gibier, M., Arwani, E., Xu, Z., Crozet, P., & Lemaire, S. D. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.08.25.505104 · Cited by 4
“Since then a number of studies improved encoding algorithms and barcoding, enabling error correction, direct access and compression (7-13).”
BackgroundFECDO-Flexible and Efficient Coding for DNA OdysseyPreprint
Sun, F., & Qian, L. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.02.18.580107 · Cited by 2
Deep learning uncovers sequence-specific amplification bias in multi-template PCRPreprint
Gimpel, A. L., Fan, B., Chen, D., Wölfle, L. O. D., Horn, M., Meng-Papaxanthos, L., Antkowiak, P. L., Stark, W. J., Christen, B., Borgwardt, K. M., et al. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.09.20.614030 · Cited by 2
Press, W. H. (2022) · PNAS Nexus · doi:10.1093/pnasnexus/pgac252 · Cited by 4
DP-DNA: A Digital Pattern-Aware DNA Encoding Scheme to Improve Encoding Density of DNA Storage
Li, B., Ou, L., Yuan, B., & Du, D. H. C. (2023) · Proceedings - International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems · doi:10.1109/mascots59514.2023.10387655 · Cited by 5
“The feasibility rules are shown in the following: • Absence of long homopolymers (less than four nucleotides) [11], [17].”
BackgroundMethodMilisavljevic, M., Rodriguez, T. R., & Tyo, K. E. J. (2024) · Biotechnology and Bioengineering · doi:10.1002/bit.28838 · Cited by 1
“Synthetic DNA is not only essential for biological research but also compelling as a durable, high ‐ density storage medium for information storage applications (Church et al., 2012; Erlich & Zielinski, 2017; Goldman et al., 2013).”
Embedding DNA-based natural language in microbes for the benefit of future researchers
Zhang, H., Huang, J., Wang, X., Gao, Z., Song, M., Li, H., Zhou, S., Wang, S., Wang, S., Yan, X., et al. (2024) · Digital Discovery · doi:10.1039/d4dd00251b · Cited by 1
Adaptive Arithmetic Coding-Based Encoding Method Toward High-Density DNA Storage
Hu, Y., Liu, Y., & Yang, Y. (2024) · Journal of Computational Biology · doi:10.1089/cmb.2024.0697 · Cited by 1
Kinetic frustration enables single-molecule computation
Zhang, Z., & Lu, Z. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0254949 · Cited by 1
Establishing a Serine Integrase‐Based Genetic Memory System In Vitro
Wang, L., Ba, F., Zhang, Y., Liu, W., & Li, J. (2025) · Biotechnology and Bioengineering · doi:10.1002/bit.28986 · Cited by 1
“DNA is a high ‐ density storage medium widely used for storing and processing information (Church et al. 2012; Goldman et al. 2013; Erlich and Zielinski 2017).”
Image Storage in DNA by an Extensible Quaternary Codec System
Pang, R., Dong, Y., & Zhao, X. (2025) · Applied Sciences · doi:10.3390/app15094760 · Cited by 1
Hardware-Accelerated Data Readout Platform Using Heterogeneous Computing for DNA Data Storage
Gou, X., Ge, Q., Guo, Q., Ren, M., Qi, T., Qin, R., & Chen, W. (2025) · Applied Sciences · doi:10.3390/app15095050 · Cited by 1
Advancements in DNA Tagging and Storage: Techniques, Applications, and Future Implications
Kuzdraliński, A., Miśkiewicz, M., Szczerba, H., Mazurczyk, W., Ociepa, T., Lechowski, M., & Ksi̜eżopolski, B. (2025) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.70040 · Cited by 1
“Goldman's approach [70] sacrifices ~83% capacity for robust Reed-Solomon encoding (0.33 bits/base), while more recent systems like DNA Fountain [77] achieve better balance, reaching 1.57 bits/base with full error recovery, representing a significant advance toward the theoretical limit of 2…”
InfluentialTamir, R., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3599794 · Cited by 5
“I N THE ever-increasing demand for digital archival storage, DNA storage systems emerge as a promising technology thanks to their extremely high information density and potential longevity [6], [9], [14], [16], [19], [24], [29], [33], [36], [38], [44].”
TransDNA: A Deep Transfer Learning Network for Sequence Reconstruction in DNA-Based Data Storage
Qin, Y., Zhu, F., Xi, B., & Duan, Y. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3602912 · Cited by 3
“laboratory settings [4], [5], [6], [7], [8], [9].”
Leal, A. G., Aoyagi, T. Y., Costa-Martins, A. G., de Souza, D. T., da Silva, C. M. F., Ueda, E. T., Parada, M. G. D. O., Feitosa, A. E., & Fujita, A. (2025) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2025.09.002 · Cited by 2
Achievable Rates of Frequency-based Channels of Unlimited Input Resolution
Tamir, R., & Weinberger, N. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195540 · Cited by 1
Tactile Information Coding for DNA Storage with Prospects for AI Applications
Han, R., Ruan, C., Tang, S., Wu, H., Ling, N., & Zhang, H. (2025) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme59968.2025.11209480 · Cited by 1
“Erlich et al. [16] introduced DNA Fountain for robust data storage.”
HDCompression-DNA: Hybrid-Diffusion Neural Image Compression via DNA Storage
Ruan, C., Lü, L., Han, R., Jiang, W., Wang, W., Wu, H., Yuan, Q., Guo, Y., Wang, Y., & Ling, N. (2025) · IEEE International Conference on Multimedia and Expo (ICME) · doi:10.1109/icme59968.2025.11210168 · Cited by 2
“Traditional approaches such as Goldman et al. [4] and DNA Fountain [5] rely on logical redundancy, achieving limited densities of 1.0–1.9 bits/nt. JPEG-DNA and VVC-DNA improve compression via conventional codecs but remain constrained by fixed schemes and poor resilience to biological noise.”
InfluentialDe-Bruijn graph partitioning for scalable and accurate DNA storage processing
Moor, F. D., Boullé, O., & Lavenier, D. D. (2025) · Bioinformatics · doi:10.1093/bioinformatics/btaf618 · Cited by 2
“These codes enable the reconstruction of the complete information from only a subset of recovered sequences while also correcting residual errors, ensuring data integrity [4] [5] [6].”
Fabrication of microcolumn arrays for high-throughput oligonucleotide synthesis using 3D printing
Kim, H., Kim, J., & Bang, D. (2025) · Scientific Reports · doi:10.1038/s41598-025-29870-x · Cited by 1
“Oligonucleotide libraries are foundational tools across various fields of biology, including synthetic biology 1 , genomics 2 , and DNA-based data storage 3,4 .”
Design and Analysis of Two-Layer Coding Scheme for DNA-Based Data Storage
Zhang, J., & Zhao, S. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3648790 · Cited by 2
“In particular, controlling the GC content and limiting homopolymer runs are essential for reducing errors [5], [18].”
Random Access in DNA Storage: Algorithms, Constructions, and Bounds
Wang, C., & Yaakobi, E. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653637 · Cited by 10
“A critical factor contributing to these inefficiencies is the coverage depth , which directly impacts system latency and cost, highlighting the urgent need for optimization [4, 9].”
On the Capacity of Noisy Frequency-based Channels
Gerzon, Y., Shomorony, I., & Weinberger, N. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653715 · Cited by 1
“DNA storage [1]–[3] presents a revolutionary approach to data archiving, and offers unparalleled data density and longevity, preserving data for millennia [4]–[7].”
Reconstructing Reed–Solomon Codes from Multiple Noisy Channel Outputs
Singhvi, S., Kiah, H. M., & Yaakobi, E. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653901
“I T ] 15 J a n 2026 codes [28], are widely used in practice as outer codes due to their optimal erasure and error correction capabilities [3], [6], [23], [27].”
Kang, T., Lim, D., Lee, W., Kim, J., Huang, X., Kim, J., & Song, Y. (2026) · ACS Nano · doi:10.1021/acsnano.5c13665 · Cited by 1
Data storage and retrieval with unnatural proteins expressed via E. coli
Zhou, Y., Ng, C. C. A., Liu, C., Tam, W. M., Lau, F. C. M., & Yao, Z. (2026) · Nature Communications · doi:10.1038/s41467-026-70061-7 · Cited by 1
Universal Framework for Parametric Constrained Coding
Kobovich, A., Leitersdorf, O., Bar-Lev, D., & Yaakobi, E. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3672710 · Cited by 1
“This is interesting for problems where the transmitted messages need to simultaneously satisfy several di ff erent constraints (e.g., a common combination in DNA data storage is to be both almost-balanced and long runs avoiding [9]).”
InfluentialZhang, J., Chen, L., Sun, J., Li, S., Zhou, Y., Wu, Z., Li, C., Zheng, Z., & Luo, R. (2026) · Nature Communications · doi:10.1038/s41467-026-71485-x · Cited by 4
Directly Encrypting DNA Sequences for Secure DNA Storage via Automata Cryptography
Kang, J., Sun, L., Liu, X., Yang, Z., Wang, B. G., Zhou, S., Cao, B., & Zheng, P. (2026) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2026.3695368 · Cited by 1
“Subsequently, the DNA Fountain [8] and the Yin-yang codec [9] changed the approach, using operations between sequences or dual rule encoding to meet constraints, reducing redundancy while increasing information density.”
Hybrid Error Correction Encoding for DNA Data Storage
Gurumayum, R., Jaiswal, A. K., & Biswas, R. (2026) · International Conference on Intelligent Processing, Hardware, Electronics, and Radio Systems (CIPHER) · doi:10.1109/cipher70417.2026.11523791 · Cited by 1
“Several studies have been conducted on constrained coding systems (also called fountain codes), as well as on using codes similar to convolutional or HEDGES for correcting indel errors [8] [10].”
Öztürk, B., İgit, A., Arıcı, S., Kaya, A., Çamlıca, Z. T., & Şahin, M. F. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10651-2 · Cited by 4
“The evaluation of DNA-based data storage systems necessitates not only an analysis of encoding and decoding algo-rithm performance but also a holistic consideration of the entire system architecture [ 67 ].”
InfluentialParallel enzymatic DNA synthesis using a semiconductor chip
Jung, W., Jung, H. S., Wang, J., Hinton, H., Kim, S. J., Zhang, Y., Chen, S., Hwang, Y., Fournier, M., Boul, M., et al. (2026) · Nature Electronics · doi:10.1038/s41928-026-01662-9 · Cited by 2
“10; we do not use error-tolerant schemes 34–37 due to a chemistry-limited length budget).”
DNA circuits for biomarker detection: from signal amplification to molecular logic
He, Z., Yi, Y., Mi, M., Xiong, T., Wu, X., Zou, T., Zhang, J., & Liang, W. (2026) · Analytical Methods · doi:10.1039/d6ay01028h · Cited by 1
Realistic Channel Model with Memory and Clustering for DNA Data Storage Using Nanopore Sequencing
Janvars, T., & Farkaš, P. (2026) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet65726.2026.11632588 · Cited by 1
Impacts of SW-ARQ on the Latency and Reliability of Diffusive, In-Sequence Molecular Communication
Furuhashi, K., Suzuki, J., Mitzman, J. S., Nakano, T., Okaie, Y., & Fukuda, H. (2018) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/seconw.2018.8396350 · Cited by 1
“, [11, 12]).”
Iterative Programming of Noisy Memory Cells
Horovitz, M., Yaakobi, E., Gad, E. E., & Bruck, J. (2019) · IEEE Transactions on Communications · doi:10.1109/itw44776.2019.8989404
“Yet another model studied in this work is motivated by DNA-based storage systems [1], [5], [9].”
BackgroundDeoxyribonucleic Acid (DNA): The Magician in the Field of the Digital Data Storage
Sun, L. (2019) · Research and Reviews on Healthcare Open Access Journal · doi:10.32474/rrhoaj.2019.03.000163 · Cited by 2
“Figure 2: The completed end-to-end automated DNA data storage system that was made by scientists from Microsoft and University of Washington, including synthesis, storage and sequencing.”
InfluentialTowards Passive, Migration-Free, Standardized, Long-Term Database Archival
Appuswamy, R. (2022) · ACM SIGMOD Record · doi:10.1145/3552490.3552506 · Cited by 1
“Second, DNA is very durable and can last millennia at ambient temperature [6].”
BackgroundInfluentialCapacity of the Shotgun Sequencing Channel
Ravi, A. N., Vahid, A., & Shomorony, I. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834409 · Cited by 3
Carbó‐Dorca, R., & Chakraborty, T. (2023) · Elsevier eBooks · doi:10.1016/b978-0-32-390257-1.00025-5 · Cited by 2
Using Soft Information to Improve Error Tolerance of Motif-Based DNA Storage Systems
Marinelli, E., Magnone, V., Dumargne, M.-C., Barbry, P., & Appuswamy, R. (2023) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/dsp58604.2023.10167945 · Cited by 1
“We conclude this section by presenting the comparison be-tween OA-DSM and SOTA methods, including LDPC coding by S. Chandak et al. [10], large-block Reed-Solomon coding by Organick et al. [11], and fountain codes by Erlich et al. [12], in terms of reading and writing costs.”
MethodNew Construction of Balanced Codes Based on Weights of Data for DNA Storage
Lu, X., & Kim, S. (2023) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2023.3293477 · Cited by 2
“Since the length of synthesized DNA sequences has been usually determined as 100-300 nt [6], [7], [8], the values of n are considered as n = 128, 200, and 240.”
BackgroundMethodInfluentialA Hybrid Approach of Image Retrieving In Biometric ID
Hasoon, J. N., Almtrf, A. A., Alagrash, Y. H., & Althubiti, M. (2023) · International Conference on Computing and Information Technology (ICCIT) · doi:10.1109/iccit58132.2023.10273904 · Cited by 1
“This presumption ignores the crucial details that DNA molecules are randomly stored and read, but it considers other significant limitations, such as homopolymers[11].”
BackgroundDynamic Sliding Window Encoding for Data Storage on DNA Under Biological and Indexing Constraints
Berton, C., Coatrieux, G., Lavenier, D. D., & Haddad, S. (2023) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco58844.2023.10289957 · Cited by 1
“Some of them only consider a maximum homopolymer length along with a balanced G-C content [6] [7], others add to their encoding scheme the possibility to limit the appearance of secondary structures [8] where a part of a sequence is complementary to another, or more generally prohibited motifs [9].”
Inkjet-printed quantum dots on paper as concept towards high-density long-term data storage
Mengel, N., Welzel, M., Niedenthal, W., Stein, M., Heider, D., & Chatterjee, S. (2024) · Journal of Physics Communications · doi:10.1088/2399-6528/ad246d
Modelling for Efficient Scientific Data Storage Using Simple Graphs in DNA
Usmani, A. R., & Wiese, L. (2024) · SN Computer Science · doi:10.1007/s42979-024-02672-0 · Cited by 1
“Therefore, along with the graph-aware data compression step, any coding method used by the existing prominent DNA-based archival storage systems [7, 10, 41] could be applied alternatively in our case without much difficulty, as shown in Fig.”
Needleman-Wunsch Attention: A Framework for Enhancing DNA Sequence Embedding
Lee, K., & No, A. (2024) · IEEE Access · doi:10.1109/access.2024.3401464 · Cited by 2
“For the model performance evaluation, we used the Qiita [42] and DNA-Fountain [43] dataset.”
MethodLevy Sooty Tern Optimization Algorithm Builds DNA Storage Coding Sets for Random Access
Zhang, J. (2024) · Entropy · doi:10.3390/e26090778 · Cited by 1
Online fountain code with an improved caching mechanism
Zhang, Y., Zhen, Z., Zhao, Y., Lau, F. C. M., Ma, B., Zhang, B., Yu, H., & Zhu, Z. (2024) · IET Communications · doi:10.1049/cmu2.12868 · Cited by 1
Parallel DNA Synthesis to Produce Multi-Usage Two-Dimensional Barcodes
Parlar, E., & Lietard, J. (2024) · Applied Sciences · doi:10.3390/app142411663 · Cited by 1
Combining Progressive Image Compression and Random Access in DNA Data Storage
Pic, X., & Appuswamy, R. (2025) · IEEE International Conference on Digital Signal Processing (DSP) · doi:10.1109/dsp65409.2025.11075047 · Cited by 2
“Following this, other works introduced other error correction solutions [6, 7, 8, 9, 10, 11, 12] with the focus of adding redundancy to binary data to detect and correct errors.”
High‐Fidelity DNA Polymerase for DNA‐Based Digital Information Storage
Liu, X., Wen, K., Yu, E., Zhao, Q., Fu, H., Zhu, J., Han, H., & Li, Q. (2025) · Small Methods · doi:10.1002/smtd.202500817 · Cited by 1
Error Correction for DNA-Based Image Storage
Lazzarotto, D. N., Testolina, M., & Ebrahimi, T. (2025) · Proceedings - International Conference on Image Processing · doi:10.1109/icip55913.2025.11084599 · Cited by 1
On Achievable Rates Over Noisy Nanopore Channels
Rameshwar, V. A., & Weinberger, N. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240460
Molecular Fountain: A Robustness Enhancement Framework for Diffusive Molecular Communication
Egashira, H., Suzuki, J., Koike–Akino, T., Nakano, T., Fukuda, H., & Orlik, P. V. (2017) · Globecom · doi:10.1109/glocom.2017.8255064 · Cited by 1
“Erlich et al. experimentally utilize LT codes for error control of DNA storage [23].”
An Efficient and Secure Forward Error Correcting Scheme for DNA Data Storage
Yatribi, A., Belkasmi, M., & Ayoub, F. (2019) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-17065-3_23 · Cited by 1
isqg: A Binary Framework forin SilicoQuantitative Genetics
Toledo, F. H. R. B., Pérez‐Rodríguez, P., Crossa, J. L., & Burgueño, J. A. (2019) · G3 Genes Genomes Genetics · doi:10.1534/g3.119.400373 · Cited by 1
Is BCH Code Useful to DNA Classification as an Alignment-Free Method?
Arruda, M. M., de Assis, F., & de Souza, T. A. (2021) · IEEE Access · doi:10.1109/access.2021.3078138 · Cited by 1
DNA fountain: As storage system
Patel, S., & Patel, D. (2021) · IP International Journal of Comprehensive and Advanced Pharmacology · doi:10.18231/j.ijcaap.2021.023 · Cited by 1
The yin–yang codec for archival DNA storage
Gupta, M. K. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00235-y · Cited by 1
Zeng, H., Mondal, M., Song, R., Zhang, J., Xia, B., Liu, M., Zhu, C., He, B., Gao, Y. Q., & Yi, C. (2018) · Angewandte Chemie · doi:10.1002/ange.201807845 · Cited by 2
Levy Equilibrium Optimizer algorithm for the DNA storage code set
Zhang, J. (2022) · PLoS ONE · doi:10.1371/journal.pone.0277139 · Cited by 1
“In 2017, Erlich et al. [6] creatively designed a "fountain code" for information storage, which is highly robust and efficient because it can avoid GC content with high deviation and the generation of homomeric.”
BackgroundMethodOn DNA Codes Over the Non-Chain Ring ℤ4 +uℤ4 +u2ℤ4 with u3 =1
Das, S., Benerjee, K. G., & Banerjee, A. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965847 · Cited by 1
“For example, two binary bits are mapped into a single nucleotide [6].”
BackgroundConstrained Code for Data Storage in DNA via Nanopore Sequencing
Whritenour, K., Civelek, M., & Farnoud, F. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10476969 · Cited by 3
“One such example is the application of Reed-Solomon codes [8] and Fountain Codes [9] for erasure errors.”
BackgroundMethodA new agent-based platform for simulating multicellular biocircuits with conjugative plasmids
Pescarmona, M. E. G. (2017) · UPM Digital Archive (Technical University of Madrid) · doi:10.20868/upm.thesis.48812 · Cited by 6
Dynamic DNA-based information storagePreprint
Lin, K. N., Keung, A. J., & Tuck, J. M. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/836429 · Cited by 1
“A growing body of work has focused on implementing and improving each of these four steps 6–11 ; however, a relative dearth of research has explored technologies to dynamically access and manipulate data within storage databases 12,13 .”
BackgroundAn Overview of DNA ‐Based Digital Data Storage
Song, X., Shah, S., & Reif, J. H. (2021) · Wiley eBooks · doi:10.1002/9783527825424.ch18 · Cited by 1
Diverse Applications of DNAzymes in Computing and Nanotechnology
Lakin, M. R., Stefanović, D., & Stojanović, M. N. (2021) · Wiley eBooks · doi:10.1002/9783527814527.ch25 · Cited by 1
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.