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 301–400 of 894
Information decay and enzymatic information recovery for DNA data storage
Meiser, L. C., Gimpel, A. L., Deshpande, T., Libort, G., Chen, W. D., Heckel, R., Nguyen, B. H., Strauß, K., Stark, W. J., & Grass, R. N. (2022) · Communications Biology · doi:10.1038/s42003-022-04062-9 · Cited by 15
Engineering DNA Materials for Sustainable Data Storage Using a DNA Movable-Type System
Gong, Z.-Y., Song, L., Pei, G., Dong, Y.-F., Li, B., & Yuan, Y. (2023) · Engineering · doi:10.1016/j.eng.2022.05.023 · Cited by 14
Error Correction for DNA Storage
Sima, J., Raviv, N., Schwartz, M., & Bruck, J. (2023) · IEEE BITS the Information Theory Magazine · doi:10.1109/mbits.2023.3318516 · Cited by 24
“There are several implementations [3], [9], [10], [14], [21], [24], [31], [37], [38], [77], [86], [99], [117], [118], [123] of in-vitro and in-vivo DNA storage demonstrating their potential and motivating the error and channel models considered in this article.”
BackgroundDNA data storage in electrospun and melt-electrowritten composite nucleic acid-polymer fibers
Soukarié, D., Nocete, L., Bittner, A. M., & Santiago, I. (2023) · Materials Today Bio · doi:10.1016/j.mtbio.2023.100900 · Cited by 20
“Leveraging the customizable nature of DNA synthesis, it is possible to encode digital information into specific DNA sequences using various algorithms [12], such as the Goldman scheme [9] or the DNA Fountain [13].”
MethodNano-sensors communications and networking for healthcare systems: Review and outlooks
Abedi, A. F. A., Goh, P., & Alkhayyat, A. H. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102367 · Cited by 14
Innovation in Constrained Codes
Immink, K. A. S. (2022) · IEEE Communications Magazine · doi:10.1109/mcom.002.2200249 · Cited by 14
“In Erlich and Zielinski’s experiments [40], both the maximum run requirement and the weak balance constraint are taken into account.”
BackgroundCommunicating over the Torn-Paper Channel
Shomorony, I., & Vahid, A. (2020) · Globecom · doi:10.1109/globecom42002.2020.9348147 · Cited by 15
“This problem is mainly motivated by macromolecule-based (and in particular DNA-based) data storage, which has recently received significant attention due to several proof-of-concept DNA storage systems [2–7].”
BackgroundRandom access and semantic search in DNA data storage enabled by Cas9 and machine-guided design
Imburgia, C. E., Organick, L., Zhang, K. H., Cardozo, N., McBride, J., Bee, C., Wilde, D., Roote, G., Jorgensen, S., Ward, D., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-61264-5 · Cited by 25
Sustainable DNA Data Storage on Cellulose Paper
Liu, Q., Wei, Y., Wang, Z., Song, D., Cui, J., & Qi, H. (2023) · Small Methods · doi:10.1002/smtd.202201610 · Cited by 14
“Multi-layer” encryption of medical data in DNA for highly-secure storage
Xu, J., Wang, Y., Chen, X., Wang, L., Zhou, H., Mei, H., Chen, S., & Huang, X. (2024) · Materials Today Bio · doi:10.1016/j.mtbio.2024.101221 · Cited by 17
“Moreover, ‘DNA fountain code ’ was proposed to offer high data storage density, leaving profound impact on the subsequent works such as the ‘DNA-of-things ’ (DoT) that explores the scalability of storing DNA information in various materials [16,17].”
BackgroundDNA palette code for time-series archival data storage
Yan, Z., Zhang, H., Lu, B., Han, T., Tong, X., & Yuan, Y. (2024) · National Science Review · doi:10.1093/nsr/nwae321 · Cited by 15
Towards next-generation DNA encryption via an expanded genetic system
Huang, X., Hou, Z., Qiang, W., Wang, H., Wang, X., Chen, X., Hu, X., Dai, J., Li, L., & Zhao, G. (2024) · National Science Review · doi:10.1093/nsr/nwae469 · Cited by 16
“It can reach an average tested theoretic information density of more than 2 bits/nt, with a maximum tested theoretic information density of 9.16 bits/nt, which should be superior to many previously reported systems [10 ,11 ,13 ,55 ].”
InfluentialWeng, Z., Li, J., Wu, Y., Xiu, X., Wang, F., Zuo, X., Song, P., & Fan, C. (2025) · Nature Communications · doi:10.1038/s41467-025-55986-9 · Cited by 20
“OurresultsareconsistentwithErlich ’ s fi ndings, and quantifying errors helps in understanding their sources as well as correcting them 12,34 .”
InfluentialFamily of Mutually Uncorrelated Codes for DNA Storage Address Design
Liu, Z., Cao, B., Shao, Q., Zheng, Y., Wang, B., Zhou, S., & Zheng, P. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3530470 · Cited by 13
“Since too high or too low GC-contents is one of the causes of increased error rates in DNA synthesis and sequencing techniques [31], [41], most experiments use DNA strands with a GC-contents close to 50% [34], [42].”
A novel one-dimensional chaotic map, novel diffusion and DNA encoding-based image encryption scheme
Dua, M., Kumar, R., Dua, S., & Chakravarty, N. (2025) · International Journal of Dynamics and Control · doi:10.1007/s40435-025-01653-2 · Cited by 14
“Research published in 2017 claims to found a scheme that allows them to store 255 petabytes of data in 1 g of Deoxyribonucleic Acid (DNA) [11].”
Sequence-Subset Distance and Coding for Error Control for DNA-based Data Storage
Song, W., Cai, K., & Immink, K. A. S. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849687 · Cited by 13
“INTRODUCTION DNA-based data storage has been progressing rapidly in recent years with the development of DNA synthesis and sequencing technology[3]-[7].”
A Strategy-based Optimization Algorithm to Design Codes for DNA Data Storage System
Rasool, A., Qu, Q., Jiang, Q., & Wang, Y. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-95388-1_19 · Cited by 16
Roadmap for network-based biocomputation
van Delft, F. C. M. J. M., Månsson, A., Kugler, H., Korten, T., Reuther, C., Zhu, J., Lyttleton, R. W., Blaudeck, T., Meinecke, C., Reuter, D., et al. (2022) · Nano Futures · doi:10.1088/2399-1984/ac7d81 · Cited by 13
“Because DNA can store ∼ 1.8 bits per nucleotide [100], a 100 kDa double-stranded DNA molecule can store ∼ 200 kB.”
BackgroundMethodInfluentialBencúrová, E., Shityakov, S., Schaack, D., Kaltdorf, M., Sarukhanyan, E., Hilgarth, A., Rath, C., Montenegro, S., Roth, G. D., Lopez, D., et al. (2022) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2022.869111 · Cited by 16
“Recent major developments had been published recently including the DNA fountain (Erlich and Zielinski, 2017), “DNA-of-things” storage architecture (Koch et al.”
BackgroundData and image storage on synthetic DNA: existing solutions and challenges
Dimopoulou, M., & Antonini, M. (2022) · EURASIP Journal on Image and Video Processing · doi:10.1186/s13640-022-00600-x · Cited by 17
“[32] have implemented an encoding using fountain codes to reach an extremely high coding potential of 1.”
MethodDNA Punch Cards: Storing Data on Native DNA Sequences via NickingPreprint
Tabatabaei, S. K., Wang, B., Athreya, N. B. M., Enghiad, B., Hernandez, A. G., Fields, C. J., Leburton, J.-P., Soloveichik, D., Zhao, H., & Milenkovic, O. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/672394 · Cited by 17
DNAsmart: Multiple attribute ranking tool for DNA data storage systems
Ezekannagha, C., Welzel, M., Heider, D., & Hattab, G. (2023) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2023.02.016 · Cited by 11
“The dataset considered for this use case was derived using the Grass encoding scheme [5] and the Fountain encoding scheme [11] containing about 713 and 1000 sequences respectively.”
BackgroundMethodStoring Images in DNA via base128 Encoding
Wang, K., Cao, B., Ma, T., Zhao, Y., Zheng, Y., Wang, B., Zhou, S., & Zhang, Q. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.3c01592 · Cited by 13
Robust multi-read reconstruction from noisy clusters using deep neural network for DNA storage
Qin, Y., Zhu, F., Xi, B., & Song, L. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.02.019 · Cited by 21
Chemical unclonable functions based on operable random DNA pools
Luescher, A. M., Gimpel, A. L., Stark, W. J., Heckel, R., & Grass, R. N. (2024) · Nature Communications · doi:10.1038/s41467-024-47187-7 · Cited by 18
Reconfigurable DNA Nanoswitches for Graphical Readout of Molecular Signals
Chandrasekaran, A. R. (2018) · ChemBioChem · doi:10.1002/cbic.201800057 · Cited by 14
Mainstream encoding–decoding methods of DNA data storage
Wang, C., Ma, G., Wei, D., Zhang, X., Wang, P., Li, C., Xing, J., Wei, Z., Duan, B., Yang, D., et al. (2022) · CCF Transactions on High Performance Computing · doi:10.1007/s42514-022-00094-z · Cited by 19
“…a new DNA storage method based on fountain code (LT code) and achieved the DNA storage and completely accurate recovery for a 2.15 MB data file (including text, operating system, image, PDF, movie, and malware) using lower sequencing depth (average coverage: ~ 10.5 ×) (Erlich and Zielinski 2017).”
MethodInfluentialEncoding of non-biological information for its long-term storage in DNA
Гарафутдинов, Р. Р., Chemeris, D. A., Sakhabutdinova, A. R., Kiryanova, O. Y., Mikhaylenko, C. I., & Chemeris, A. V. (2022) · Biosystems · doi:10.1016/j.biosystems.2022.104664 · Cited by 14
Basis-Finding Algorithm for Decoding Fountain Codes for DNA-Based Data Storage
He, X., & Cai, K. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3241773 · Cited by 14
“In [21], an efficient DNA-based data storage architecture named DNA fountain was proposed, which featured a fountain code for a set of DNA strands as the outer code.”
BackgroundMethodInfluentialReconstructing trees from traces
Davies, S., Rácz, M. Z., & Rashtchian, C. (2021) · The Annals of Applied Probability · doi:10.1214/21-aap1662 · Cited by 17
Lietard, J., Schaudy, E., Hölz, K., Ameur, D., & Somoza, M. M. (2019) · Journal of Visualized Experiments · doi:10.3791/59936 · Cited by 15
Novel Encryption Algorithm for Securing Sensitive Information Based on Feistel Cipher
Ali, S. M. A., & Hasan, H. F. (2019) · TEST Engineering & Management · Cited by 13
Image storage in DNA using Vector Quantization
Dimopoulou, M., & Antonini, M. (2020) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco47968.2020.9287470 · Cited by 17
Self-replicating digital data storage with synthetic chromosomes
Lu, X., & Ellis, T. (2021) · National Science Review · doi:10.1093/nsr/nwab086 · Cited by 12
Improved DNA based storage capacity and fidelity using composite DNA lettersPreprint
Anavy, L., Vaknin, I., Atar, O., Amit, R., & Zohar Yakhini, B. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/433524 · Cited by 12
“Namely, we need to define a decoding map: f: XN → Φk (8) We infer the original letter from the observed vector xN by first calculating a proportion vector π(x): π(x) = (πA(x), πC(x), πG(x), πT(x)) = ( xA Nx ⁄ , xC Nx ⁄ , xG Nx ⁄ , xT Nx ⁄ ) , Nx = ∑ xi i∈{A,C,G,T} (9)”
Boulgakov, A. A., Xiong, E., Bhadra, S., Ellington, A. D., & Marcotte, E. M. (2018) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/470211 · Cited by 11
Encoding, Decoding, and Rendering Information in DNA Nanoswitch Libraries
Talbot, H., Halvorsen, K., & Chandrasekaran, A. R. (2022) · ACS Synthetic Biology · doi:10.1021/acssynbio.2c00649 · Cited by 13
Liquid Metal Electrodynamic Accumulation Microfluidics System for DNA Memory and Liquid Biopsy
Jeong, Y., Noh, S., Yu, M., Chang, S., Eun, H. S., Kim, J. C., & Song, Y. (2023) · Advanced Functional Materials · doi:10.1002/adfm.202305680 · Cited by 12
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Bar-Lev, D., Sabary, O., Gabrys, R., & Yaakobi, E. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3496587 · Cited by 32
“In the typical model of DNA-based storage systems [8], [17], [23], the data is stored as a codeword that can be described by a vector of length-ℓ sequences or strands over the alphabet Σ = { A, C, G, T } .”
InfluentialData Readout Techniques for DNA‐Based Information Storage
Liu, B., Wang, F., Fan, C., & Li, Q. (2025) · Advanced Materials · doi:10.1002/adma.202412926 · Cited by 14
Optical Detection of Lasers with Near-term Technology at Interstellar Distances
Clark, J. R., & Cahoy, K. (2018) · The Astrophysical Journal · doi:10.3847/1538-4357/aae380 · Cited by 11
Spotting, Transcription and In Situ Synthesis: Three Routes for the Fabrication of RNA Microarrays
Lietard, J., & Somoza, M. M. (2019) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2019.06.004 · Cited by 12
“BeyondWatson-Crick-based DNA/DNA pairing, DNAmicroarrays have become sensing platforms as well as tools to investigate DNA-binding proteins and are rapidly gaining interest as a costeffective method for DNA synthesis en route towards DNA-based digital information storage solutions [16,17] [18].”
MethodWhat kind of network is the brain?
Mollon, J. D., Takahashi, C., & Danilova, M. V. (2022) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2022.01.007 · Cited by 17
“In an independent literature, computer scientists have shown the feasibility of storing large quantities of data in tiny volumes of DNA [14,86,87].”
BackgroundExtended XOR Algorithm with Biotechnology Constraints for Data Security in DNA Storage
Bi, K., Lu, Z., Ge, Q., & Gu, W. (2022) · Current Bioinformatics · doi:10.2174/1574893617666220314114732 · Cited by 10
Oligo replication advantage driven by GC content and Gibbs free energy
Qiao, H., Gao, Y., Liu, Q., Wei, Y., Li, J., Wang, Z., & Qi, H. (2022) · Biotechnology Letters · doi:10.1007/s10529-022-03295-2 · Cited by 12
“2020; Erlich and Zielinski 2017).”
BackgroundLi, Y., Du, D. H.-C., Ou, L., & Li, B. (2022) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd56317.2022.00071 · Cited by 21
“In other words, when the strand length increases, the errors happening on each nucleotide bind also exponentially increase [8], [15], [18]–[21].”
BackgroundMethodModelling, Characterization of Data-Dependent and Process-Dependent Errors in DNA Data Storage
Wang, Y., Noor‐A‐Rahim, M., Gunawan, E., Guan, Y. L., & Poh, C. L. (2023) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2022.3233914 · Cited by 15
“Moreover, by comparing the experimental dilution effect in (Erlich and Zielinski, 2017) with the simulated dilution effect in a modified version of the computational model in (Chen et al.”
BackgroundMethodResultInfluentialPark, S., Kim, S., Jeong, J., No, A., No, J., & Park, H. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btad548 · Cited by 13
“As a result, we demonstrate that our work reduces 7.46% of a writing cost and 26.57%, 19.41% of a reading cost on average compared with the results in Erlich and Zielinski (2017) and Jeong et al. (2021), respectively.”
InfluentialRigidity-induced scale invariance in polymer ejection from capsid
Linna, R. P., Suhonen, P. M., & Piili, J. (2017) · Physical review. E · doi:10.1103/physreve.96.052402 · Cited by 11
“Hence, a single simulation length unit can be taken to correspond to the width of dsDNA, which is about 2 nm.”
BackgroundInfluentialPulsar positioning system: a quest for evidence of extraterrestrial engineering
Vidal, C. (2017) · International Journal of Astrobiology · doi:10.1017/s147355041700043x · Cited by 14
“…progress in DNA computing and DNA data storage suggests that even if DNA is slow to write and read, it has other qualities such as long data retention and a data density carrying capacity orders of magnitudes higher than today ’ s best storage technologies (Extance 2016; Erlich & Zielinski 2017).”
Correlation between polar surface area and bioferroelectricity in DNA and RNA nucleobases
Yam, S.-C., Zain, S. M., Lee, V. S., & Chew, K. (2018) · The European Physical Journal E · doi:10.1140/epje/i2018-11696-5 · Cited by 11
Organick, L., Chen, Y.-J., Ang, S. D., Lopez, R., Strauss, K., & Ceze, L. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/565150 · Cited by 11
Achievable Rates of Concatenated Codes in DNA Storage under Substitution ErrorsPreprint
Lenz, A., Welter, L., & Puchinger, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.00051 · Cited by 21
Preserving DNA in Biodegradable Organosilica Encapsulates
Koch, J., Kerl, A.-C., Schawalder, N., Luescher, A. M., Nguyen, B. H., Strauß, K., Stark, W. J., & Grass, R. N. (2022) · Langmuir · doi:10.1021/acs.langmuir.2c01167 · Cited by 10
VSD: A Novel Method for Video Segmentation and Storage in DNA Using RS Code
Hong, J., Rasool, A., Wang, S., Ziou, D., & Jiang, Q. (2024) · Mathematics · doi:10.3390/math12081235 · Cited by 11
Efficient DNA Synthesis Codes with Error Correction and Runlength Limited Constraint
Nguyen, T. T., Cai, K., & Immink, K. A. S. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619131 · Cited by 10
“Most experiments used DNA strands whose maximum run is of length at most three [3], [13].”
MethodShotgun Sequencing of 512‐mer Copolyester Allows Random Access to Stored Information
Jang, H., Chu, H., Noh, H., & Kim, K. T. (2024) · Angewandte Chemie International Edition · doi:10.1002/anie.202415124 · Cited by 11
Pragmatic soft-decision data readout of encoded large DNA
Ge, Q., Qin, R., Liu, S., Guo, Q., Han, C., & Chen, W. (2025) · Briefings in Bioinformatics · doi:10.1093/bib/bbaf102 · Cited by 10
“Integrating error correction codes such as Fountain codes, Reed–Solomon (RS) codes, and low-density parity-check (LDPC) codes with bioinformatics pipelines can correct some errors in the coarsely assembled sequences, but indels are difficult to entirely correct [10, 15, 23–27].”
Halami, B., Shahsavari, S., Nelson, Z., Prehoda, L., Eriyagama, D. N. A. M., & Fang, S. (2018) · ChemistrySelect · doi:10.1002/slct.201801484 · Cited by 10
Capacity of the Erasure Shuffling Channel
Shin, S., Heckel, R., & Shomorony, I. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053486 · Cited by 12
Parallelizing Assignment Problem with DNA Strands.
Khorsand, B., Savadi, A., & Naghibzadeh, M. (2020) · PubMed Central · doi:10.30498/ijb.2020.195413.2547 · Cited by 10
Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels
Sakogawa, R., & Kaneko, H. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174050 · Cited by 14
“Here, the ratio of pi and pd(= 5pi) is assumed according to [17], and word length isN = 152 according to [9].”
BackgroundMethodGenerative DNA: Representation Learning for DNA-based Approximate Image Storage
Franzese, G., Yan, Y., Serra, G., D'Onofrio, I., Appuswamy, R., & Michiardi, P. (2021) · Visual Communications and Image Processing · doi:10.1109/vcip53242.2021.9675366 · Cited by 12
“Till date, current work on DNA storage has focused on dealing with errors introduced by the imprecise nature of synthesis and sequencing [5], [9], [8], [17], [16].”
BackgroundOptimal Single Chromosome-Inversion Correcting Codes for Data Storage in Live DNA
Nguyen, T. T., Cai, K., Song, W., & Immink, K. A. S. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834376 · Cited by 13
Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm
Dougherty, S. T., Korban, A., Şahinkaya, S., & Üstün, D. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3217518 · Cited by 10
“In additional to the above constraints, in [8], [24], and [45], it is shown that good DNA codes should not have codewords which contain consecutive repetitions of a specific nucleotide ( GC TTTT AC ) and in [28] and [30], it is shown that good DNA codes should not have codewords which contain a…”
BackgroundAn image cryptography method by highly error-prone DNA storage channel
Zan, X., Xie, R., Chu, L., Su, Y., Yao, X., Xu, P., & Liu, W. (2023) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2023.1173763 · Cited by 12
“) are difficult to synthesize and prone to sequencing errors, most of the DNA storage works comply with some encoding constraints on the DNA sequences, such as the GC content of 45%–55% and homopolymer runs of ≤ 3nt (Erlich and Zielinski, 2017).”
Content-based filter queries on DNA data storage systems
El-Shaikh, A., & Seeger, B. (2023) · Scientific Reports · doi:10.1038/s41598-023-34160-5 · Cited by 12
“C2 is necessary because long consecutive repeats of the same nucleotide destabilize DNA strands, and sequencing machines fail to read them correctly 11 .”
BackgroundLandsman, D., & Strauß, K. (2023) · Computer · doi:10.1109/mc.2023.3272188 · Cited by 13
DUHI: Dynamically updated hash index clustering method for DNA storage
Wang, P., Cao, B., Ma, T., Wang, B., Zhang, Q., & Zheng, P. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2023.107244 · Cited by 12
Lin, W., Chu, L., Su, Y., Xie, R., Yao, X., Zan, X., Xu, P., & Liu, W. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2023.107548 · Cited by 10
A dual-rule encoding DNA storage system using chaotic mapping to control GC content
Zhang, X., Qi, B., & Niu, Y. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae113 · Cited by 14
“Erlich and Zielinski (2017) proposed a novel DNA storage method based on Fountain code (LT code) in 2017 and achieved 2.15 MB data files (including Text, OS, Image, PDF, Movie, and Software) for DNA storage and entirely accurate recovery, which does not require repeated sequencing and significantly…”
MethodInfluentialEmbedded Codes for Reassembling Non-Overlapping Random DNA Fragments
Nassirpour, S., & Vahid, A. (2020) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2020.3035370 · Cited by 14
“In this article, we focus on non-overlapping random DNA fragments while [33] focuses on overlapping fragments reassembled using indices.”
BackgroundMethodHow wide is the application of genetic big data in biomedicine
Liu, Y., Li, N., Zhu, X. M., & Qi, Y. (2020) · Biomedicine & Pharmacotherapy · doi:10.1016/j.biopha.2020.111074 · Cited by 11
Biomedical Data: Their Acquisition, Storage, and Use
Shortliffe, E. H., & Chiang, M. F. (2021) · Springer eBooks · doi:10.1007/978-3-030-58721-5_2 · Cited by 10
Design of DNA Storage Coding with Enhanced Constraints
Li, X., Zhou, S., & Zou, L. (2022) · Entropy · doi:10.3390/e24081151 · Cited by 12
“[13] proposed a new coding method of DNA fountain; this method’s code density is close to what is theoretically optimal in this scheme, and the performance of retrieving experimental data is improved by order of magnitude compared with previous work.”
MethodA Characterization of the DNA Data Storage Channel
Heckel, R., Mikutis, G., & Grass, R. N. (2019) · Scientific Reports · doi:10.1038/s41598-019-45832-6 · Cited by 9
An open-source, 3D printed inkjet DNA synthesizer
Kim, J., Kim, H., & Bang, D. (2024) · Scientific Reports · doi:10.1038/s41598-024-53944-x · Cited by 10
Yang, B., Cui, T., Guo, L., Dong, L., Wu, J., Xing, Y., Xu, Y., Chen, J., Wang, Y., Cui, Z., et al. (2024) · Biomacromolecules · doi:10.1021/acs.biomac.4c00259 · Cited by 10
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Gruica, A., Bar-Lev, D., Ravagnani, A., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619151 · Cited by 23
“Reducing the coverage depth presents an opportunity for a drastic improvement in latency and cost reduction [14]–[17].”
Zhong, W., Geng, C., Fu, Z., Mao, C., Zheng, Y., Wang, S., Liu, K., Yang, Y., Lü, C., & Jiang, X. (2024) · Analytical Chemistry · doi:10.1021/acs.analchem.4c04637 · Cited by 10
A practical DNA data storage using an expanded alphabet introducing 5-methylcytosine
Liu, D., Xu, D., Shi, L., Zhang, J., Bi, K., Luo, B., Liu, C., Li, Y., Fan, G., Wang, W., et al. (2025) · Gigabyte · doi:10.46471/gigabyte.147 · Cited by 10
Zhou, Y., Bi, K., Xu, Q., Liu, Q., Zhao, X., Ge, Q., & Lu, Z. (2025) · ACS Nano · doi:10.1021/acsnano.4c17817 · Cited by 11
Advancing Archival Data Storage: The Promises and Challenges of DNA Storage System
Sensintaffar, A., Wei, Y., Ou, L., Du, D. H. C., & Li, B. (2025) · ACM Transactions on Storage · doi:10.1145/3723166 · Cited by 17
“Beyond designing simple ECCs around basic bio-constraints, some of the more complex bio-constraints, such as inter-complementary, intra-complementary, and maintaining a sufficient Hamming distance, are often not included in ECC designs.”
InfluentialStable DNA Storage Encoding Scheme Based on Repeating Substring Tree
Wu, J., Wang, P., Zheng, Y., Wang, B., Zhang, Q., & Zheng, P. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3586008 · Cited by 10
“In 2017, Erlich et al. [20] proposed an encoding method for fountain codes, which raised the encoding potential to a high value of 1.98 bits/nt. Yazdi et al. [7] designed an integrated processing pipeline, and they exploited efficient. ortable sorting with new iterative calibration and deletion…”
InfluentialA compact cassette tape for DNA-based data storage
Li, J., Mao, C., Wang, S., Li, X., Luo, X., Wang, D., Zheng, S., Shao, J., Wang, R., Fan, C., et al. (2025) · Science Advances · doi:10.1126/sciadv.ady3406 · Cited by 12
“To achieve this function, we encoded two digital files (one text file and one image file) using the DNA Fountain (100 nt) ( 39 ), added a restriction enzyme cutting sequence (4 nt) for file removal at the 3 ′ end of the sequence, and added the primer sequence (20 nt) for complementary base pairing…”
Liu, X., Zheng, Y., Li, X., Wang, B., Zhou, S., Cao, B., & Zheng, P. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.131726 · Cited by 12
Current and emerging opportunities in biological medium‐based computing and digital data storage
Bennet, D., Vo‐Dinh, T., & Zenhausern, F. (2021) · Nano Select · doi:10.1002/nano.202100275 · Cited by 9
DNA storage in everyday objects
Farzadfard, F. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0376-8 · Cited by 9
One-time-pad cipher algorithm based on confusion mapping and DNA storage technology
Peng, W., Cui, S., & Song, C. (2021) · PLoS ONE · doi:10.1371/journal.pone.0245506 · Cited by 9
“Inspiring by the DNA cryptography schemes [9, 30, 32, 33], we proposed a one-time-pad cipher algorithm based on confusion mapping and DNA storage technology.”
MethodLaunay, K., Amalian, J., Laurent, E., Oswald, L., Ouahabi, A. A., Burel, A., Dufour, F., Carapito, C., Jean-Louis, C., Lutz, J., et al. (2020) · Angewandte Chemie · doi:10.1002/ange.202010171 · Cited by 10
Generative Adversarial Networks for DNA Storage Channel Simulator
Kang, S., Gao, Y., Jeong, J., Park, S., Kim, J.-W., No, J., Jeon, H., Lee, J. W., Kim, S., Park, H., et al. (2023) · IEEE Access · doi:10.1109/access.2023.3235201 · Cited by 12
“The data density of DNA storage can reach 215 petabytes per gram [4].”
BackgroundMethodBIC Codes: Bit Insertion-Based Constrained Codes With Error Correction for DNA Storage
Park, S., Park, H., Kwak, H.-Y., & No, J. (2023) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2023.3268274 · Cited by 12
Synthetic biology—Engineering nature to make materials
Ball, P. (2018) · MRS Bulletin · doi:10.1557/mrs.2018.165 · Cited by 9
Electrically Controlled Nanofluidic DNA Sluice for Data Storage Applications
Athreya, N. B. M., Khandelwal, A., Li, X., & Leburton, J. (2021) · ACS Applied Nano Materials · doi:10.1021/acsanm.1c02519 · Cited by 10
Behr, J., Michel, T., Giridhar, M., Santhosh, S., Das, A., Sabzalipoor, H., Kekić, T., Parlar, E., Ilić, I., Ibáñez-Redín, G., et al. (2024) · ChemRxiv · doi:10.26434/chemrxiv-2024-j4c90 · Cited by 12
Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score and Redecoding
Jeong, J., Park, H., Kwak, H.-Y., No, J., Jeon, H., Lee, J. W., & Kim, J.-W. (2023) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2023.3284406 · Cited by 11
“We follow the encoding scheme of [17] like our previous works [22], [25] and show the performance improvement by modifying the decoding algorithm.”
BackgroundMethodInfluentialGradHC: highly reliable gradual hash-based clustering for DNA storage systems
Shabat, D. B., Hadad, A., Boruchovsky, A., & Yaakobi, E. (2024) · Bioinformatics · doi:10.1093/bioinformatics/btae274 · Cited by 8
Exploring DNA Computers: Advances in Storage, Cryptography and Logic Circuits
Xie, X., Wang, S., Chen, Z., Yu, Y., Hu, X., Ma, N., Ji, M., & Tian, Y. (2024) · ChemBioChem · doi:10.1002/cbic.202400670 · Cited by 11
SemAI: Semantic Artificial Intelligence-Enhanced DNA Storage for Internet of Things
Wu, W., Xiang, L., Liu, Q., & Yang, K. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3477314 · Cited by 9
“Currently, with the rapid development of DNA synthesis and sequencing technologies, DNA storage has witnessed numerous groundbreaking advancements [8], [9], [10], [11], [12], [13], [14].”
Sequence-specific, mechanophore-free mechanochemistry of DNA
Hahmann, J., Schüpp, B. N., Ishaqat, A., Selvakumar, A., Göstl, R., Gräter, F., & Herrmann, A. (2025) · Chem · doi:10.1016/j.chempr.2024.11.014 · Cited by 10
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.