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 501–600 of 894
DNA Bloom Filter enables anti-contamination and file version control for DNA-based data storage
Li, Y., Zhang, H., Chen, Y., Shen, Y., & Ping, Z. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae125 · Cited by 6
“The same experiment is also performed on sequences encoded by DNA Fountain [5] (DNA Fountain library), the result shows a similar anti-contamination ability (Figure S7) and robustness ( Figure S8).”
MethodSoft-Decision Decoding for DNA-Based Data Storage
Zhang, M., Cai, K., Immink, K. A. S., & Chen, P. (2018) · International Symposium on Information Theory and its Applications · doi:10.23919/isita.2018.8664305 · Cited by 7
“In our simulations, as the raw error rate of the system is not given in [8], we follow [3] and [7] to set the substitution, insertion, and deletion error rates, respectively.”
BackgroundMethodInfluentialCapacity of Noisy Permutation Channels
Tang, J., & Polyanskiy, Y. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834509 · Cited by 5
[Daily "routine chest x-ray" in ventilated surgical intensive care patients].
Beyermann, K., Kußmann, J., Gartenschläger, M., Herrmann, A. M., Busch, H., & Stein, K. (1993) · PubMed · Cited by 8
Extended nucleic acid memory as the future of data storage technology
Biswas, S., Nath, S., Sing, J. K., & Sarkar, S. K. (2020) · International Journal of Nano and Biomaterials · doi:10.1504/ijnbm.2020.10029630 · Cited by 5
A Novel Soft-In Soft-Out Decoding Algorithm for VT Codes on Multiple Received DNA Strands
Yan, Z., Qu, G., & Wu, H. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206446 · Cited by 6
OligoArchive-DSM: Columnar Design for Error-Tolerant Database Archival using Synthetic DNAPreprint
Marinelli, E., Yan, Y., Magnone, V., Dumargne, M.-C., Barbry, P., Heinis, T., & Appuswamy, R. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.10.06.511077 · Cited by 5
“Figure 11 compares our error rates with those reported in prior work on DNA storage [11, 14, 16, 17, 24].”
ResultEfficient and low-complexity variable-to-variable length coding for DNA storage
Gao, Y., & No, A. (2024) · BMC Bioinformatics · doi:10.1186/s12859-024-05943-y · Cited by 5
“Nonetheless, our algorithm specifically targets the source coding problem under homopolymer and GC content constraints, with the aim of achieving optimal encoding as proposed by Erlich and Zielinski [2].”
InfluentialSurvey of Sequence Reconstruction Problems and Their Applications in DNA-Based Storage
Yang, Y. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3595457 · Cited by 4
“From theoretical perspectives, the data retrieval process can be modeled as a channel with input S. Related models include the outer channel [179], the shuffling-sampling channel [124], the sliced channel [180], and the DNA storage channel [181].”
Coding for Strand Breaks in Composite DNA
Walter, F., & Yehezkeally, Y. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195278 · Cited by 9
Nature‐Inspired Innovation in Electrical Engineering Technologies and Applications
Li, M., Mao, A., Guan, Q., Xu, Y., Li, C., Lü, G., & Saiz, E. (2025) · Advanced Science · doi:10.1002/advs.202512250 · Cited by 7
Advances and challenges in non-canonical nucleic acids data storage
Wang, Y., Pei, Y., Tang, L., Sun, X., Zhou, S., & Song, J. (2026) · Nature Communications · doi:10.1038/s41467-026-68708-6 · Cited by 9
Towards learning-based image compression for storage on DNA support
Strebel, S., Monnier, N., Lazzarotto, D. N., Testolina, M., & Ebrahimi, T. (2023) · SPIE Applications of Digital Image Processing · doi:10.1117/12.2677356 · Cited by 4
“Lately, Schwarz et al. 13 have implemented a library with not only a similar approach as Erlich et al., 11 but also more recent fountain codes such as Online codes 14 and Raptor codes.”
MethodOptimizing fountain codes for DNA data storage
Schwarz, P. M., & Freisleben, B. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.10.038 · Cited by 6
“Figure 8 shows the same experiment for the robust soliton distribution using the default parameters defined in the implementation of Erlich and Zielinski [1].”
Exploring potential biosafety implications in DNA information storage
Li, S., Shi, Y. X., Yang, J., Liu, H., Jia, L., & Liu, D. (2025) · Biosafety and Health · doi:10.1016/j.bsheal.2025.03.006 · Cited by 5
In-vitro validated methods for encoding digital data in deoxyribonucleic acid (DNA)
Mortuza, G. M., Guerrero, J. E., Llewellyn, S., Tobiason, M. D., Dickinson, G. D., Hughes, W. L., Zadegan, R. M., & Andersen, T. (2023) · BMC Bioinformatics · doi:10.1186/s12859-023-05264-6 · Cited by 5
“Some known methods utilize mapping codes where a single digital value maps to a single base-value [21, 22, 24].”
BackgroundMethodInfluentialTurbo autoencoders for the DNA data storage channel with Autoturbo-DNA
Welzel, M., Dreßler, H., & Heider, D. (2024) · iScience · doi:10.1016/j.isci.2024.109575 · Cited by 5
Dou, C., Yang, Y., Zhu, F., Li, B., & Duan, Y. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae363 · Cited by 6
“However, when confronted with strict biochemical constraints, these methods can give rise to issues related to inefficient coding or high time complexity [ 20, 21].”
BackgroundMethodA Novel DNA‐Based Dual‐Mode Data Storage System with Interrelated Concise and Detailed Data
Pei, B., Zhou, Y., Yu, Y., Ma, J., Cao, R., Huang, W. L., Ouyang, L., Mi, S., & Xiong, Z. (2024) · Small Science · doi:10.1002/smsc.202400094 · Cited by 5
Two RRNS-Based Error Correction Schemes for DNA Storage Channels
Luo, J., Mu, L., Huang, Y. J. W., Yan, Y., Han, G., & Zhong, Y. (2024) · IEEE Communications Letters · doi:10.1109/lcomm.2024.3481265 · Cited by 5
“Notable among these are Reed-Solomon (RS) codes [3], cyclic redundancy check (CRC) codes [4], low-density parity-check (LDPC) codes [5], [6] [1], polar codes [7], and fountain codes [8].”
Zhu, G., Zhang, Q., Peng, B., Liu, S., Lin, C., Kuehne, A. J. C., Cheng, M., & Shi, F. (2025) · Supramolecular Materials · doi:10.1016/j.supmat.2025.100099 · Cited by 4
An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads
Welter, L., Sokolovskii, R., Heinis, T., Wachter-Zeh, A., Rosnes, E., & Amat, A. G. I. (2026) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2026.3655592 · Cited by 19
Epigenomic Hard Drive Imprinting: A Hidden Code Beyond the Biological Death of Cancer Patients
Nilendu, P., & Sharma, N. K. (2017) · Journal of Cancer Prevention · doi:10.15430/jcp.2017.22.4.211 · Cited by 4
Image cryptography based on the imitation of gene fusion and horizontal gene transfer
Hamici, Z. M. (2017) · International Conference on Image Processing Theory, Tools and Applications (IPTA) · doi:10.1109/ipta.2017.8310153 · Cited by 4
“However, their work was only realized in high-tech research laboratory since the storage and retrieval cost was 3500USD per Mbyte of data [23].”
BackgroundPlaying with genetic and epigenetic concepts at the school: an Epigenetic Orchestra project
Alonso, C., & Palomares, Y. (2021) · Evolution Education and Outreach · doi:10.1186/s12052-021-00146-y · Cited by 4
“Finally, parallels between computer systems and DNA storage capacities can be exposed to highlight the outstanding capacity of DNA structure for storing and faithfully transmitting information (see e.g., Erlich and Zielinski 2017).”
BackgroundUsing Artificial Neural Networks to Model Errors in Biochemical Manipulation of DNA Molecules
Guo, A. J. X., & Qi, H. (2021) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2021.3088525 · Cited by 4
“In [10], Erlich et al. designed a DNA fountain along with the Reed-Solomon code.”
MethodDNA archival storage, a bottom up approach
Sella, O., Apelbaum, A., Heinis, T., Quah, J., & Moore, A. W. (2021) · ACM Workshop on Hot Topics in Storage and File Systems (HotStorage) · doi:10.1145/3465332.3470880 · Cited by 7
“This problem is addressed in FountainDNA [9], where the Luby transform repeatedly generates pseudo-random coded data until a satisfactory output is reached.”
BackgroundA Quaternary Code Correcting a Burst of at Most Two Deletion or Insertion Errors in DNA Storage
Khuat, T.-H., & Kim, S. (2021) · Entropy · doi:10.3390/e23121592 · Cited by 8
“In recent years, because of its huge capacity and excellent durability, deoxyribonucleic acid (DNA) storage is becoming attractive for future long-term data storage [1–3].”
BackgroundUnclonable Polymers and Their Cryptographic Applications
Almashaqbeh, G., Canetti, R., Erlich, Y., Gershoni, J. M., Malkin, T., Pe’er, I., Roitburd‐Berman, A., & Tromer, E. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-06944-4_26 · Cited by 4
“DNA can be readily cloned and read with excellent fidelity, both by nature and by existing technology [14,24,32,45].”
BackgroundSelf-citationFrameD: framework for DNA-based data storage design, verification, and validation
Volkel, K., Lin, K. N., Hook, P. W., Timp, W., Keung, A. J., & Tuck, J. M. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad572 · Cited by 5
Optimal Almost-Balanced Sequences
Bar-Lev, D., Kobovich, A., Leitersdorf, O., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619424 · Cited by 4
“Another approach to dealing with media degradation is to generate strands of DNA that have approximately balanced GC-content, and this approach has been leveraged in several existing works such as [4]–[6].”
BackgroundProcessing DNA-Based Molecular Signals into Graphical Displays
Chandrasekaran, A. R. (2020) · ACS Synthetic Biology · doi:10.1021/acssynbio.0c00246 · Cited by 4
Lee, U. J., Hwang, S., Kim, K. E., & Kim, M. (2020) · Biotechnology and Bioprocess Engineering · doi:10.1007/s12257-020-0022-9 · Cited by 5
A quaternary code mapping resistant to the sequencing noise for DNA image coding
Dimopoulou, M., Antonio, E. G. S., & Antonini, M. (2020) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp48831.2020.9287126 · Cited by 5
“In the state of the art there have been proposed some very interesting algorithms for encoding an input stream into a robust quaternary representation ( [3], [4], [5], [6], [7], [8]).”
BackgroundIn vivo multi-dimensional information-keeping in Halobacterium salinarumPreprint
Davis, J., Bisson‐Filho, A. W., Kadyrov, D., Kort, T. M. D., Biamonte, M. T., Thattai, M., Thutupalli, S., & Church, G. M. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.02.14.949925 · Cited by 7
Single-Read Reconstruction for DNA Data Storage Using TransformersPreprint
Nahum, Y., Ben-Tolila, E., & Anavy, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.05478 · Cited by 13
“Some recent work on DNA based storage systems presented end-to-end solutions including molecular implementations (Organick et al. 2018; Erlich and Zielinski 2017; Organick et al. 2020).”
BackgroundShotgun Sequencing of 512‐mer Copolyester Allows Random Access to Stored Information
Jang, H., Chu, H., Noh, H., & Kim, K. T. (2024) · Angewandte Chemie · doi:10.1002/ange.202415124 · Cited by 3
Oligonucleotide subsets selection by single nucleotide resolution barcode identification
Kim, W., Chon, M., Koh, Y., Choi, H., Choi, E., Park, H., Jung, Y., Ryu, T., Kwon, S., & Choi, Y. (2025) · Nature Communications · doi:10.1038/s41467-025-56856-0 · Cited by 3
“The read counts of the target sequence vary depending on the alignment method, but if some errors are allowed, the counts are similar to those obtained by aligning only to the barcode.”
Scaling the High-Yield Potential of Large-Scale DNA Data Storage with Cap-Free DNA Synthesis
Lin, W., Yu, H., Li, W., Han, Y., Lv, M., Gao, H., Cheng, M., Huang, Y., Bi, K., Lu, Z., et al. (2025) · ACS Synthetic Biology · doi:10.1021/acssynbio.5c00175 · Cited by 3
Comparison of state-of-the-art error-correction coding for sequence-based DNA data storage
Gimpel, A. L., Remschak, A., Stark, W. J., Heckel, R., & Grass, R. N. (2026) · Nature Communications · doi:10.1038/s41467-026-70548-3 · Cited by 11
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Gruica, A., Bar-Lev, D., Ravagnani, A., & Yaakobi, E. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3623202 · Cited by 13
“Reducing the coverage depth presents an opportunity for a drastic improvement in latency and cost reduction [14], [15], [16], [17].”
Santhosh, S., Istvánffy, S., Sabary, O., Yaakobi, E., Giridhar, M., Behr, J., & Somoza, M. M. (2025) · Communications Chemistry · doi:10.1038/s42004-025-01755-0 · Cited by 4
Park, H. M., Fargher, H. A., Song, K., Liu, H., Gu, Q., Lidskog, A., Dang, F., Makarov, D. E., & Anslyn, E. V. (2026) · Journal of the American Chemical Society · doi:10.1021/jacs.5c21819 · Cited by 3
On the Long-Term Behavior of k-Tuples Frequencies in Mutation Systems
Elishco, O. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3456597 · Cited by 5
“…[12], [22], [30], [37], protecting against errors that occur in the synthesis process and during storage (due to stability issues) [5], [7], [9], [14], [27], [32], [39], [40], [50], and preventing errors that may occur in the reading process due to technical limitations of current techniques…”
A New Algebraic Approach for String Reconstruction From Substring Compositions
Gupta, U., & Mahdavifar, H. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3493762 · Cited by 3
Effective IDS Error Correction Algorithms for DNA Storage Channels With Multiple Output Sequences
Deng, C., Han, G., Han, P., & Fang, Y. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3558853 · Cited by 3
More on codes for combinatorial composite DNA
Ye, Z., Sabary, O., Gabrys, R., Yaakobi, E., & Elishco, O. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01634-8 · Cited by 5
“The expense of DNA storage is influenced by both the cost of DNA synthesis and the price of data retrieval via DNA sequencing It is reported that synthesis cost per position is approximately 80 , 000 times more expensive than sequencing cost per position [4].”
Capacity of Frequency-Based Channels: Encoding Information in Molecular Concentrations
Gerzon, Y., Shomorony, I., & Weinberger, N. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3578504 · Cited by 8
“As a prominent example, in DNA storage systems [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], information is encoded to K molecules, each of which is a strand of length L composed from the four possible nucleotides, denoted by A : = { A , C , G , T } .”
Wetzl, C., Soukarié, D., Elosua, J. Y., & Santiago, I. (2025) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.5c06554 · Cited by 4
Cipher constrained encoding for constraint optimization in extended nucleic acid memory
Biswas, S., Dey, S., Nath, P., & Nath, S. (2022) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2022.107696 · Cited by 3
Lu, X., & Kim, S. (2022) · International Conference on Advanced Technologies for Communications · doi:10.1109/atc55345.2022.9943019 · Cited by 3
“Moreover, the fountain codes [7] were also applied to DNA storage systems.”
MethodStudy on DNA Storage Encoding Based IAOA under Innovation Constraints
Du, H., Zhou, S., Yan, W., & Wang, S. (2023) · Current Issues in Molecular Biology · doi:10.3390/cimb45040233 · Cited by 5
“Each gram of DNA can store 215 PE of data [5], and it takes only 2.”
BackgroundMethodInfluentialTowards long double-stranded chains and robust DNA-based data storage using the random code system
Yang, X., Shi, X., Lai, L., Chen, C., Xu, H., & Deng, M. X. (2023) · Frontiers in Genetics · doi:10.3389/fgene.2023.1179867 · Cited by 3
“With these rules, Erlich et al. (Erlich and Zielinski, 2017) reported a coding strategy called DNA Fountain in 2017, which demonstrated a theoretical coding potential of 1.98 bits per nucleotide.”
MethodInfluentialSais, M., Rafalia, N., & Abouchabaka, J. (2023) · E3S Web of Conferences · doi:10.1051/e3sconf/202341201090 · Cited by 4
“These two DNA strands are hence complementary to one another [34], [35].”
BackgroundPermutation Sum-Capacity of Binary Adder Multiple-Access Channels
Lu, W., & Makur, A. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206781 · Cited by 3
“from their relevance to DNA storage systems, which are attractive mediums for archival storage due to their high density and reliability [17], [18].”
BackgroundRekadwad, B. N., Shouche, Y. S., & Jangid, K. (2023) · Archives of Microbiology · doi:10.1007/s00203-023-03694-7 · Cited by 3
High-Risk Sequence Prediction Model in DNA Storage: The LQSF Method
Ma, Y., Chen, S., Qi, X., Lu, Z., & Bi, K. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3424576 · Cited by 3
On the Long-Term Behavior of k-tuples Frequencies in Mutation Systems
Elishco, O. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619643 · Cited by 3
“The first avenue studies in-vitro storage, in which information is synthesized and stored in a specialized container (see, for example, [1], [4]–[6], [8], [10], [12], [14], [20], [25], [28], [30], [32], [35]–[38], [40], [48]).”
BackgroundBead‐Based DNA Synthesis and Sequencing for Integrated Data Storage Using Digital Microfluidics
Piao, Y., Fang, Y., Li, B., Man, T., Chen, J., Zhu, F., Wang, W., Wan, Y., & Deng, S. (2024) · Angewandte Chemie · doi:10.1002/ange.202416004 · Cited by 5
A DNA Data Storage Method Using Spatial Encoding Based Lossless Compression
ŞATIR, E. (2024) · Entropy · doi:10.3390/e26121116 · Cited by 5
“access to data blocks and the locations Erlich and Zielinski (2017) [24] synthetic They presented the DNA Fountain method that is highly robust and approaches the information capacity per nucleotide. within the blocks.”
Input Optimization in the Composite DNA Storage Channel
Kobovich, A., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3595005 · Cited by 7
On Achievable Rates Over Noisy Nanopore Channels
Rameshwar, V. A., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3598773 · Cited by 8
Storing Digital Data in Nucleic Acid Memory with Extended Genetic Alphabet
Biswas, S., Nath, S., Sing, J. K., & Sarkar, S. K. (2019) · Devices for Integrated Circuit (DevIC) · doi:10.1109/devic.2019.8783912 · Cited by 3
“Another methodology applied for efficient data storage in DNA was DNA fountain [10].”
MethodDNA Compression using an innovative Index based Coding Algorithm
Zahra, S. E., Masood, K., & Asif, M. (2019) · International Multi-Topic Conference · doi:10.1109/inmic48123.2019.9022799 · Cited by 3
“Data compression also gained more importance because the speed of business chip has been expanding generally 70% consistently, while the speed of product DRAM has improved by minimal over half over the previous decade [11][12] as shown in Fig.”
BackgroundStoring Digital Data Into DNA: A Comparative Study Of Quaternary Code Construction
Dimopoulou, M., Antonini, M., Barbry, P., & Appuswamy, R. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054654 · Cited by 3
“[6] Our work (raw data)”
MethodOn Decoding Fountain Codes with Erroneous Received Symbols
He, X., & Cai, K. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457594 · Cited by 3
“However, in practice, there may exist errors within the output DNA strands of the inner ECC decoder, which are caused by complicated channel errors that are not detectable by the inner ECC [21].”
BackgroundMethodInfluentialSolving the subset sum problem with a nonideal biological computer
Konopik, M., Korten, T., Linke, H., & Lutz, E. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac2005 · Cited by 3
“[9] Erlich Y and Zielinski D DNA Fountain enables a robust and efficient storage architecture 2017 Science 355 950-954.”
BackgroundDNA Sequence Error Corrections based on TensorFlow
Al-Barhamtoshy, H. M., & Younis, R. A. A. (2020) · International Arab Conference on Information Technology (ACIT) · doi:10.1109/acit50332.2020.9300094 · Cited by 3
“They used the substitution correction without indels (insertion and deletion) correction (Erlich & Zielinski , 2017).”
MethodDNA Image Storage Using a Scheme Based on Fuzzy Matching on Natural Genome
Zhang, J., Chen, S., Zhang, H., Shen, Y., & Ping, Z. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-91415-8_48 · Cited by 3
Fundamentals of Computer Science
Puster, E. (2022) · Springer eBooks · doi:10.1007/978-3-030-93765-2_2 · Cited by 3
Signal generation and storage in FRET-based nanocommunications
Kmiecik, J., Wojcik, K., Kułakowski, P., & Jajszczyk, A. (2019) · Nano Communication Networks · doi:10.1016/j.nancom.2019.100254 · Cited by 3
Using DNA For Data Storage: Encoding and Decoding Algorithm Development
Suyehira, K. (2018) · ScholarWorks (Boise State University) · doi:10.18122/td/1500/boisestate · Cited by 4
“In their experiments, Erlich and Zielinski used a Reed Solomon code attached to each droplet.”
BackgroundMethodResultInfluentialCui, M., & Zhang, Y. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/725499 · Cited by 3
Secure data storage on DNA hard drivesPreprint
Chen, K., Zhu, J., Bošković, F., & Keyser, U. F. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/857748 · Cited by 5
“complexity of DNA synthesis, still exist and have not been resolved even after years of optimization to achieve scalable and inexpensive data storage (9).”
BackgroundDNA Computing: Methodologies and Challenges
Sharma, D., & Ramteke, M. (2021) · Wiley eBooks · doi:10.1002/9783527825424.ch2 · Cited by 3
Cao, B., Li, X., Wang, B., He, T., Zheng, Y., Zhang, X., & Zhang, Q. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.08.15.608111 · Cited by 3
Optimization of Highly Robust DNA Storage Schemes Based on Specific Base Sequences
Zhang, X., Qi, B., & Niu, Y. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3553616 · Cited by 2
“…rules and optional mapping rules to encode the bytes interleaved, thus ensuring that the homopolymer length was less than 4 nt. Erlich et al. [10] proposed a fountain coding scheme that packs binary numbers into droplets and then performs Luby transformation and screening to obtain a DNA…”
InfluentialKumar, D., & Paul, G. C. (2025) · Ain Shams Engineering Journal · doi:10.1016/j.asej.2025.103447 · Cited by 2
Efficient Nested Hash Reassembly Codes for Torn Paper Channels
Jiao, X., Jiao, B., Mu, J., & Han, H. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3582709 · Cited by 5
“Since then, several DNA-based storage prototypes have been presented to demonstrate the viability of DNA as a medium for high-density archival data storage [6], [7], [8], [9], [10], [11], [12].”
Tian, K., Zhang, S., Chen, S., Chingarande, G. R., Hou, C., Ma, E., Ren, J., Ding, S., Stertzer, M., Luan, B., et al. (2025) · PNAS Nexus · doi:10.1093/pnasnexus/pgaf233 · Cited by 3
“DNA data storage is an emerging technology that encodes digital information into DNA sequences, offering significant advantages over conventional storage methods, including exceptionally high data density ( 16 – 28), low energy consumption (16), long-term durability, and ease of replication.”
InfluentialNeural Polar Decoders for DNA Data Storage
Aharoni, Z., & Pfister, H. D. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3610751 · Cited by 8
“The DNA storage pipeline [5], [11], [12], [13], [14], [15] typically encodes digital data into multiple short sequences over a 4-ary alphabet, which are synthesized and stored in an unordered pool.”
DBSP: An End-to-End Pipeline for DNA Storage Data Reconstruction From DNA Sequencing
Cao, B., Zhao, Y., Xie, L., Shao, Q., Wang, K., Wang, B., Zhou, S., & Zheng, P. (2025) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2025.3613268 · Cited by 6
“Under external coding, fountain codes have 5% greater redundancy than Reed-Solomon (RS) codes do to achieve the same error correction capability [18].”
InfluentialPredicting sequence-specific amplification efficiency in multi-template PCR with deep learning
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. (2025) · Nature Communications · doi:10.1038/s41467-025-64221-4 · Cited by 5
“49 (meanAUROC/AUPRC:0.71/0.17), aswell as Erlich et al. 22 and Gao et al. 19 (0.87/0.17).”
InfluentialOn the Reliability of Information Retrieval from MDS Coded Data in DNA Storage
Hanna, S. K. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195362 · Cited by 4
“Notably, such behavior aligns with typical experimental observations [9], [11], [35].”
Motif caller for sequence reconstruction in motif-based DNA storage
Agarwal, P., Pinnamaneni, N., & Heinis, T. (2025) · Scientific Reports · doi:10.1038/s41598-025-22798-2 · Cited by 2
“In fact, estimates suggest that all the digital data in the world could theoretically be stored in a space no larger than a shoebox 7 .”
Correcting Errors in Composite DNA: Channel Model and Code Design
Wang, C., Nguyen, T. T., Cai, K., & Zhang, Y. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240521 · Cited by 3
“With the development of synthesis and sequencing technologies, DNA macromolecules have been an attractive medium for digital information storage [1]–[4].”
DNA diamond formulates a decomposable composite letter constellation model for DNA data storage
Ge, Q., Ren, M., Qi, T., Han, C., Yuan, Y., & Chen, W. (2026) · Nature Communications · doi:10.1038/s41467-026-68861-y · Cited by 3
“Several DNA storage systems guaranteed homopolymer length through appropriate encoding, e.g., rotation coding 4 or homopolymer fi ltering 9 .”
InfluentialFrom deep archival to real-time applications: Challenges and opportunities in DNA data storage
Liu, Q., Liu, Q.-J., Kang, S., Li, J., Xia, H., & Qi, H. (2026) · Biotechnology Advances · doi:10.1016/j.biotechadv.2026.108833 · Cited by 3
Large‐Scale Distribution of Physical Data Using DNA‐of‐Things Technology in Newspaper Printing
Granito, F., Gimpel, A. L., Stark, W. J., Heckel, R., & Grass, R. N. (2026) · Small · doi:10.1002/smll.202511931 · Cited by 1
“Continuous improvements in DNA synthesis [48], sequencing, and error correction [5, 7, 19, 28] will further facilitate the integration of DNA-based storage into both scientific and commercial sectors [20].”
DNA Data Storage Architecture via Ligation of Dynamic DNA Bytes
Jia, L., Shi, Y., Yang, J., Li, S., Yang, W., Li, W., Zhang, M., Li, Q., Zhang, Y., Wang, X., et al. (2026) · Small Methods · doi:10.1002/smtd.202502001 · Cited by 2
Photoresponsive DNA steganography for secure information transmission by nanopore
Hu, Z., Wang, J., Liu, S.-C., Wang, J.-H., Ma, H., Yang, C. C. C.-C., Ying, Y., Yan, F., & Long, Y.-T. (2026) · National Science Review · doi:10.1093/nsr/nwag196 · Cited by 2
“Inspired by evolutionary natural selection, DNA has emerged as a promising medium for artificial data storage [1 –4 ].”
Zhang, Y., Qin, R., Ge, Q., Guo, Q., & Chen, W. (2026) · Science Advances · doi:10.1126/sciadv.aec1469 · Cited by 4
“1A) ( 1 , 2 , 5 ).”
Xeno nucleic acids (XNAs): advances in synthesis, diagnostics, and therapeutics
Lee, W., Kang, T., Yu, M., Haider, Z., Lim, D., & Song, Y. (2026) · Bioorganic Chemistry · doi:10.1016/j.bioorg.2026.110000 · Cited by 2
Neural Network-Based Decoding of Constrained Codes for DNA Data Storage
Li, P., Cai, K., Song, G., Song, W., Mei, Z., & Zhong, X. (2020) · IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia) · doi:10.1109/icce-asia49877.2020.9277107 · Cited by 3
“DNA data storage systems are much more compact and durable than any of the existing data storage systems, and hence it has emerged as a very promising candidate for the storage of Big Data for the consumers [2,3].”
BackgroundHow to Enable Index Scheme for Reducing the Writing Cost of DNA Storage on Insertion and Deletion
Lin, Y., Liang, Y.-P., Chen, T., Chang, Y.-H., Chen, S.-H., Wei, H., & Shih, W. (2022) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3516482 · Cited by 4
Scalable Combinatorial Assembly of Synthetic DNA for Tracking Applications
Stuart, J. D., Wickenkamp, N. R., Davis, K. A., Meyer, C., Kading, R. C., & Snow, C. D. (2023) · International Journal of Molecular Sciences · doi:10.3390/ijms24032549 · Cited by 2
Comparative Analysis of Clustering Methodologies in DNA Storage
Sankar, S., Wang, Y., Jiayu, Z., Sabrina, N. N., Gunawan, E., Guan, Y. L., Noor‐A‐Rahim, M., & Poh, C. L. (2022) · International Computer Science and Engineering Conference · doi:10.1109/icsec56337.2022.10049327 · Cited by 2
“Some of the research group have recovered data back using the former method and they predicted the sequencing redundancy required to reduce dropout rate accordingly [4], [5], [6].”
MethodInfluentialDNA-Storage in Future Communication Networks
Hofmann, P., Cabrera, J. A., Krieg, E., Bassoli, R., & Fitzek, F. H. P. (2023) · IEEE Communications Magazine · doi:10.1109/mcom.011.2200755 · Cited by 2
Cellular Surveillance: DNA-Based Recording to Monitor and Memorize Biological Events
David, G., O’Keefe, R. T., & Cai, Y. (2023) · GEN Biotechnology · doi:10.1089/genbio.2023.0018 · Cited by 2
“9 Another method is the incorporation of a ‘‘suicide circuit,’’ either using an SSR recorder to count cell division events and induce cell death after a specified number of generations, or a simple inducible circuit that produces a toxic gene upon induction.”
RepairNatrix: a Snakemake workflow for processing DNA sequencing data for DNA storage
Schwarz, P. M., Welzel, M., Heider, D., & Freisleben, B. (2023) · Bioinformatics Advances · doi:10.1093/bioadv/vbad117 · Cited by 2
“Typically, a custom script (Erlich and Zielinski 2017) or a customized version of a workflow designed for biological data (Welzel et al. 2023) is used.”
Method
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.