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 801–894 of 894
Bi, K., Ma, Z., Xu, Q., Zhou, Y., Ma, Y., Sun, Q., & Lu, Z. (2025) · Medical & Biological Engineering & Computing · doi:10.1007/s11517-025-03458-z · Cited by 1
“DNA-Fountain and Yinyang algorithms used their original settings with constraints of 40–60% GC content and maximum homopolymer length 3[16, 18].”
InfluentialPioneering DNA-Based Systems: Novel Encoding and Security for Computing and Storage
Bopalkar, A., Iyer, H., Mantri, S., & Bedekar, M. V. (2025) · International Conference on Computing Communication Control and automation · doi:10.1109/iccubea65967.2025.11284266
“[6].”
LT Code Design for Device-to-Device Coded Caching Storage Systems Using Shoulders of GiAnds
Haytaoğlu, E. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3644448
“Today, they are used practically in many communication-based systems such as cellular systems, video caching, traditional distributed storage systems, and even in DNA storage systems [33].”
PERFECT PCR: Advancing DNA Data Storage to Near-Maximal DensityPreprint
Sabnis, R., Zhang, H., Li, B., Han, A., de Figueiredo, P., & Sun, Q. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2025.12.15.694532
“Although significant strides in computational methods have mitigated the need for physical redundancy and enhanced accuracy, predicting lost data accurately remains a challenge, particularly in cases where models are not sufficiently trained ( 6, 22, 24, 25, 32, 33 ).”
Polus: a Transformer-based Soft-decision Codec Enhancement Platform for DNA StoragePreprint
Ding, L., Wang, K., Zhang, H., Xie, S., Wang, J., Лю, Б., Wang, G., Liu, L., & Zhu, Z. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2025.12.16.694663
“In the Encoding stage, digital files are firstly converted into DNA oligonucleotide libraries using a selected codec (e.g., DNA Fountain, YYC, or Derrick), producing constraint-compliant sequences with addressing and parity ( Supplementary Note 1 ).”
InfluentialEngineering chimeric DNA polymerases for DNA movable type storagePreprint
Liu, X., Zhao, Q., Yu, E., Jia, L., Shi, Y. X., Liu, D., Han, H., & Li, Q. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2025.12.18.694503
“DNA, a natural genetic biomaterial, has emerged as a promising alternative to conventional digital storage media due to its high information density, long-term stability, and low energy demands during storage [ 3-5 ].”
Additional file 1 of DeSP: a systematic DNA storage error simulation pipeline
Yuan, L., Xie, Z., Wang, Y., & Wang, X. (2022) · Figshare · doi:10.6084/m9.figshare.19785532
The Relational Completeness of the DNA Query Language DNAQL
Brijder, R., Gillis, J., & den Bussche, J. V. (2026) · ACM Transactions on Database Systems · doi:10.1145/3779650
“As large artificial DNA-based storage is rapidly becoming a reality [5, 10, 11, 14, 16, 19, 20], there are significant efforts to equip this storage medium with efficient search capabilities [4, 15, 24, 30].”
A Hybridization-Based Novel DNA Storage Technology with Rapid Read PerformancePreprint
Zhang, Y., Jia, L., XiaoXia, W. A. N. G., Shi, Y., Wang, H., Zhang, D., Cheng, P., Zhao, Y., Xu, M., Zhang, X., et al. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2025.12.24.696143
Batch optimization for balanced binary sequences and DNA sequences
Ma, Y. (2025) · BMC Bioinformatics · doi:10.1186/s12859-025-06336-5
Sensintaffar, A., Du, D. H.-C., & Li, B. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00074 · Cited by 1
Fast bootstrap and reliable readout using hidden references for DNA data storage
Chen, W., Liu, S., Guo, Q., Qin, R., Ge, Q., Qi, T., & Yuan, Y. (2026) · iMeta · doi:10.1002/imt2.70105
Han, L., Qu, G., Yan, Z., & Wu, H. (2025) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads67057.2025.11323030
“It holds the potential to revolutionize the way we store and preserve digital data [3], [4], [5], [6].”
Roy, S., Ji, H. P., & Lau, B. T. (2026) · Scientific Reports · doi:10.1038/s41598-026-37575-y
“However, there is relatively little published work on developing a physical media format that provides long-term storage of DNA data 4,7,8 .”
Error characterization and error correction approaches in combinatorial DNA-based storage
Preuss, I., Sabary, O., Gabrys, R., Yakhini, Z., Yaakobi, E., & Anavy, L. (2026) · Scientific Reports · doi:10.1038/s41598-026-38599-0
A Wavelet-based Image Coding Framework for Data Storage on DNA
Qin, C., Bai, Y., Zhao, W., & Liu, X. (2025) · IEEE International Conference on Visual Communications and Image Processing (VCIP) · doi:10.1109/vcip67698.2025.11396797
“Erlich et al. [6] further enhanced the compression rate by modifying the established fountain code theory.”
Advancements in DNA storage: innovations, challenges, and the road ahead
Shukla, S., Borah, N. K., Sinha, A., & Shukla, S. K. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-40316-3.00007-2
Majority‐Voting Overlapping Method for Error Correction in DNA Data Storage
Nguyen, T. B. N., Seo, S., Tandon, A., Uyen, N. K., Vu, T. H. N., & Park, S. H. (2026) · Advanced Intelligent Discovery · doi:10.1002/aidi.202500209
DNA-based image storage with substitution and indel error correction
Lazzarotto, D. N., Piguet, F., & Ebrahimi, T. (2025) · Picture Coding Symposium · doi:10.1109/pcs65673.2025.11417580
“Erlich et al. [6] proposed the use of Fountain codes for DNA-based storage, further reducing the gap between the maximum theoretical information density of the constrained DNA channel and an actual implementation using the Luby Transform.”
Adaptive Sampling For Storage Of Progressive Images On Dna
Pic, X., Pinnamaneni, N., & Appuswamy, R. (2025) · Picture Coding Symposium · doi:10.1109/pcs65673.2025.11417598
“Following this, other error correction solutions [5, 6, 7, 8, 9, 10, 11] appeared, by adding redundancy to binary data to detect and correct errors.”
DNA-MGC+: A versatile codec for reliable and resource-efficient data storage on synthetic DNAPreprint
Khabbaz, R., Mateos, J., Antonini, M., & Hanna, S. K. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.03.11.711016 · Cited by 4
“Existing designs include codecs that combine dropout recovery with error detection 3,12,15–19 , codecs that jointly address dropouts and substitution errors 6,20–22 , codecs whose ECCs support dropout recovery together with correction of all three types of IDS errors 14,23–25 , and codecs that…”
InfluentialTaştan, C., & Aydin, B. (2026) · Research Square · doi:10.21203/rs.3.rs-9083123/v1
Code Constructions for DNA-Based Data Storage
Liu, S., Wu, K., & Zhang, Y. (2025) · Globecom · doi:10.1109/globecom59602.2025.11431890
“With the exponential growth of data volume, DNA has emerged as a potential storage media due to its high density and longevity [1].”
The Natural Coding of Language: SPECTRA is All You NeedPreprint
Feng, Y., Tao, S., Zhang, X., Huang, M., Zhou, D., Chen, L., Liu, D., Yang, G., Xiao, H., Wang, Y., et al. (2026) · Research Square · doi:10.21203/rs.3.rs-9255583/v1
Short Code with GC-Balance and Run-Length Limitation for DNA Storage
Chen, L. (2025) · International Conference on Communications and Broadband Networking (ICCBN) · doi:10.1109/iccbn67217.2025.11447605
“DNA-based data storage has emerged as a potential solution for ultra–high-density and durable information archiving [2]– [5].”
Clustering-Free and Clustering-Based Outer Channel Modeling and Decoding for DNA Storage
Yuan, Z., Ding, Y., He, X., & Tang, X. (2025) · International Workshop on Signal Design and its Applications in Communications · doi:10.1109/iwsda67899.2025.11457431
“First, it decodes each strand from the physical channel independently, such as in [1], [3].”
InfluentialSynthesis and modification of abiotic sequence-defined poly(phosphodiester)s
König, N. F. (2018) · theses.fr (ABES) · doi:10.70675/6ef3b2e7z2816z4a5az8be2z3b48e157b815
de Hervé, J. D. G. (2019) · theses.fr (ABES) · doi:10.70675/f8dff6e1za2acz40f8za607z2c80dc0357dd
Synthèse de polycarbamates à séquences définies pour le stockage d'information
Petit, B. É. (2019) · theses.fr (ABES) · doi:10.70675/19251df8ze820z4d3azb463z7f53cbab1c60
Kurylo, I. (2018) · theses.fr (ABES) · doi:10.70675/a02f464bzb64bz413aza4c2z7580393b0102
MS/MS sequencing methodologies to read encoded polymers
Amalian, J. (2019) · theses.fr (ABES) · doi:10.70675/fb5aec01zbe36z4129zaf09zdc8e386a87c1
Synthesis of new alkoxyamine spacers for the elaboration of encoded polymers
Launay, K. (2020) · theses.fr (ABES) · doi:10.70675/b32012b4zca6az4075z86f4zd547cd9d0ab8
Encoding techniques for long-term storage of digital images into synthetic DNA
Dimopoulou, M. (2020) · theses.fr (ABES) · doi:10.70675/d039c47cz06a8z4c12z9699zc8aefdd17f10 · Cited by 5
Scalable and accurate algorithms for computational genomics and dna-based digital storage
Yan, Y. (2023) · theses.fr (ABES) · doi:10.70675/2d1f5f53z65ebz4476z88acz990021e9e6d9
DNA data storage algorithms and synchronization
Hamoum, B. (2022) · theses.fr (ABES) · doi:10.70675/7722069cz1034z4e64z8238z6126d6f7f792
Towards Migration-Free Data Preservation using Synthetic DNA
Marinelli, E. (2024) · theses.fr (ABES) · doi:10.70675/fdf5d1b7z9765z4811zaee7zde2f28f9ba0b
Sécurité des données stockées sur molécules d’ADN
Berton, C. (2024) · theses.fr (ABES) · doi:10.70675/0f5289f1z1beaz4311z8029za15b04416483 · Cited by 1
liu, Z., Zhang, Z., Xu, F., Chen, K., & Pan, L. (2026) · Nanotechnology · doi:10.1088/1361-6528/ae5dd6
Impact of PCR Cycles and Mutation Rate on Linear DNA Barcode Detection
Font‐Segura, J. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11462641
Optimized End-to-End Coding Workflow for Image Storage and Retrieval Using JPEG DNA
Testolina, M., Hanna, S. K., & Antonini, M. (2026) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp55912.2026.11460799
DNA Data Storage: A Novel Approach to High Density, Long Term Digital Storage
Banerjee, P., Hashim, M., Mitra, D., Upreti, K., Jain, R., Kumar, A., & Kumar, M. (2026) · El-Cezeri Fen ve Mühendislik Dergisi · doi:10.31202/ecjse.1663692 · Cited by 1
ZAT-DNA enables DNA data storage with molecular-layer non-replicability
Song, L., Wang, G., Wei, Y., Huang, Y., Zhang, Y., Liu, X., Yuchi, Z., Yuan, Y., Luo, Y., & Zhang, Y. (2026) · Nature Communications · doi:10.1038/s41467-026-72869-9 · Cited by 3
“The encoding process comprises two steps: First, dividing large datasets into small data chunks and augmenting them with redundancy through outer erasure codes, such as Fountain or Reed-Solomon (RS) codes 3,5,6 .”
InfluentialDNA Staples: An oligonucleotide library for data storage and computingPreprint
Wernhart, K. S., Orlando, M., Schroeder, F., & Barišić, I. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.05.11.724305
“Furthermore, it offers data densities that significantly exceed those of conventional storage [4, 5, 6].”
InfluentialPropelling DNA-Based Archival Storage With an Algorithmic Mindset
Yang, Y., Wei, W., & Mou, M. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3694522
“Restrictions apply. techniques employed in recent prototypes (e.g., DNA Fountain [5], Hedges [117], and DNA-Aeon [118]).”
InfluentialDNA-Based Boolean Logic Gates for Molecular Computation and Biosensing: A Critical Review
Srinivasan, A., Kesavan, H., Rajendran, U., Palayam, T., Bakthavatchalam, S., & Vinayagam, R. (2026) · Molecular Biotechnology · doi:10.1007/s12033-026-01582-1 · Cited by 1
RIDE: Random interleaving data encoding method for enhancing DNA storage efficiency
Bi, K., Ma, Z., Li, Z., Sun, Q., Lu, Z., & Zhao, X. (2026) · Results in Engineering · doi:10.1016/j.rineng.2026.111485 · Cited by 1
From Blueprint to Breakthrough: How Far Can We Fold DNA Origami for Nano-Enabled Technologies?
Yadav, A. K., Verma, D., & Bhatia, D. D. (2026) · JACS Au · doi:10.1021/jacsau.5c01315 · Cited by 1
Bio-inspired approaches to in vivo DNA data storage systems
Zhang, Y., Liu, Y., Wan, S., Su, J., Zhang, H., Wang, F., & Liu, K. (2026) · Materials Horizons · doi:10.1039/d6mh00728g
Luo, H., Gao, J., Huang, X. F., Fang, Y., Huang, T., Xia, Y., Yu, Z., Cao, C., & Xiong, Z. (2026) · Advanced Materials · doi:10.1002/adma.73806
“Over the past decades, advances in encoding strategies [6–8], DNA synthesis [9–15], sequencing readout [16–19], and molecular encapsulation [20–28] have collectively established the feasibility of DNA as an information medium [12].”
A dual-mode encoding DNA storage system using parity alternation to balance GC content
Zhang, X., Han, C., Wang, Y., Wang, Y., & Niu, Y. (2026) · Ain Shams Engineering Journal · doi:10.1016/j.asej.2026.104305
Hash-Driven Dynamic Encoding for Secure and Biologically Inert DNA Data Storage
Yang, B., Shao, H., Deng, X., & Jiang, Y. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3708209
Direct-Transpose Architecture-Aided Joint Coding-Synchronization Schemes for DNA Data Storage
Lu, L., Yang, Z., Zhan, J., Fang, Y., & Han, G. (2026) · IEEE Communications Letters · doi:10.1109/lcomm.2026.3708460
“Conventional error-correcting codes such as Reed–Solomon codes [8], LDPC codes [9], and foun-tain codes [10], [11] effectively mitigate substitution errors but exhibit limited capability in handling synchronization errors.”
Pandithurai, O., Praveenkumar, J., & Meena Nanditha, S. (2026) · International Conference on System, Computation, Automation and Networking (ICSCAN) · doi:10.1109/icscan66520.2026.11588403
“Erlich and Zielinski [4] introduced DNA Fountain, which uses LT-code principles to achieve near-capacity storage with random-access retrieval and strong theoretical reliability.”
Time Resolved DNA Barcodes for Information Encoding and Dynamic Encryption
Chu, L., Wang, H., Gao, H., Chen, S. T., Li, Z., Hao, Z., He, L., & Han, D. (2026) · Advanced Science · doi:10.1002/advs.76492
“Given an average tag length of 28 bases, the logical coding density is 0.036 bits/base, lower than the 1.5–1.8 bits/base reported for sequence-based DNA encoding systems such as DNA Fountain [ 29 ].”
InfluentialRobust Composite DNA Storage under Sampling Randomness, Substitution, and Insertion–Deletion Errors
Tegin, B., & Duman, T. M. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11586851 · Cited by 1
Random access elevates DNA from a storage medium to a storage system
Yu, H., Lu, Z., Li, D., Yuan, Y., & Liu, Q. (2026) · Trends in biotechnology · doi:10.1016/j.tibtech.2026.06.020
Gao, W., Liu, Q., Deng, Y., Wu, W., & Yang, K. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11587236
“Subse-quently, in 2017, Erlich combined RS codes with fountain codes to achieve higher information density [11].”
A Theoretical Framework for Run-Length-Limited Coding in Composite DNA
Dang, D. H., & Kim, S. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3715557 · Cited by 1
“…data storage has received increasing attention as a potential solution for long-term data archiving, since DNA can remain stable over extended time periods, store information at very high physical densities, and be reliably read using widely available sequencing technologies [1], [2], [3], [4].”
An Open-Quantum-Systems Theory of Quantum-Biological Communication Channels
Dong, L. F. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3716243
Cost-Efficient Information Writing-in for DNA Data Storage
Xu, D., Ping, Z., & Shen, Y. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_2
Image Coding for Storage on Synthetic DNA: Standardization Efforts and Challenges
Testolina, M., & Antonini, M. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_14
Shield, Repair, Reconstruct: An Integrated Framework for Long-Term DNA Data Storage
Liu, L., Wu, J., Huang, Y., Wang, M., He, B., Song, L., & Sun, J. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_10
DNA Nanostructures for Storage Architecture
Heinis, T. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_4
Optimization of Error Correction Schemes for DNA Synthesis and Sequencing
Wu, H., & Qu, G. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_7
End to End Rewritable DNA Data Storage
Rajesh, A. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_15
Rapid and Accurate Information Reading-Out
Zhao, X., Li, J., Fan, Q., Hu, J., Pan, Q., & Li, Y. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_3
Wu, Y., Wang, J., Liu, S., Liu, Y., Hou, X., Zhang, J., Lv, Z., Wang, Z., Luo, S., Gu, H., et al. (2026) · Angewandte Chemie International Edition · doi:10.1002/anie.4267702
Wu, Y., Wang, J., Liu, S., Liu, Y., Hou, X., Zhang, J., Lv, Z., Wang, Z., Luo, S., Gu, H., et al. (2026) · Angewandte Chemie · doi:10.1002/ange.4267702
Rational Molecular Design to Improve Digital Polymer Readout in Aerolysin‐Based Nanopore Sequencing
Yang, Z., Juarez, J. F. B., Obeid, G., Agerova, A., Bryner, T. R., Cois, D., Marcaida, M. J., Cao, C., Peraro, M. D., & Lutz, J. (2026) · Angewandte Chemie · doi:10.1002/ange.1446100
Rational Molecular Design to Improve Digital Polymer Readout in Aerolysin‐Based Nanopore Sequencing
Yang, Z., Juarez, J. F. B., Obeid, G., Agerova, A., Bryner, T. R., Cois, D., Marcaida, M. J., Cao, C., Peraro, M. D., & Lutz, J. (2026) · Angewandte Chemie International Edition · doi:10.1002/anie.1446100
Molecular access control for random-access DNA data storagePreprint
Bögels, B. W. A., Vermathen, R. T., Yurchenko, A., Takahashi, C. N., Markvoort, A. J., & de Greef, T. F. A. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.08.12.744375
“However, typical DNA data storage uses much lower coverage 6,8 .”
CRISPR-Cas12a-based querying of DNA-stored MRI and PET imaging data
Fu, R., Hong, J., Qu, Q., Hong, Z., Jiang, Q., & Xianyu, Y. (2026) · Medical Image Analysis · doi:10.1016/j.media.2026.104272
Always-Aligned Half-Marker-Aided Soft Information Generation for DNA Data Storage
Zhang, Y., Yuan, Y., & Chen, W. (2026) · IEEE Communications Letters · doi:10.1109/lcomm.2026.3726284
“DNA data storage encodes and distributes digital information across numerous unordered strands [2], [3].”
Coverage Depth Analysis: Random Access for DNA Storage over Noisy Channels
Abraham, H., Feldman, I., & Yaakobi, E. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653660 · Cited by 2
Coding for DNA Synthesis Repeats
Li, Z., Nguyen, T. T., Cai, K., He, X., & Tang, X. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11654128
“In contrast to traditional storage media, DNA offers significantly high information density and durability [4]–[6].”
Capacity of Noise-Erasure-Permutation Channels
He, X., Ding, Y., Cai, K., Song, G., Dai, B., & Tang, X. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653782
A Sequential Random Sampling Approach to PIR in DNA-based Data Storage
Wang, C., Yaakobi, E., & Yakhini, Z. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11654042 · Cited by 2
“Sequencing remains costly despite technological advances [4– 7], inspiring the study of coverage depth [7–9], defined here as the number of sequencing reads required for reliable data recovery.”
On Composite DNA Codes with Multiple Constraints
Benerjee, K. G., & Banerjee, A. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11654149
“…, consecutive identical nucleotides, increase synthesis and sequencing errors [2], [8]–[12]; (ii) GC -weight imbalance affects thermodynamic stability and PCR amplification uniformity [13]–[15]; and (iii) secondary structures from complementary base pairing disrupt synthesis and PCR [16].”
A Review of Confidentiality, Integrity, and Availability Challenges in Molecular Communications
Anderson, M. I., Duong, T., Oguchi, E. P., Wiśniewska, A., & Ghose, N. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3730015
“Restrictions apply.”
A security Comparison of Cryptosystems Based on DNA
Abboodi, A. A., Alkiffai, A. N., & Yassein, H. R. (2026) · Boletim da Sociedade Paranaense de Matemática · doi:10.5269/bspm.81388
Yan, Y., Luo, Y., Huang, Z., & Li, X. (2026) · Procedia Computer Science · doi:10.1016/j.procs.2026.08.164
Nontraditional molecular-bit DNA storage
Liu, X., Wu, R., Liang, Y., Gong, Y., Zhang, Y., & Zhang, C. (2026) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2026-0924
Towards A System Model for DNA-based Storage
Schustermann, S., Kogan, L., Factor, M., Naor, D., & Yadgar, G. (2026) · ACM Workshop on Hot Topics in Storage and File Systems (HotStorage) · doi:10.1145/3837053.3837346
Zang, Z., Jia, S., Jia, S., Zhang, Q., Zhang, T., Wu, L., Wang, P., Shufang, 张. Z., Wu, H., & Yu, J. (2026) · Advanced Engineering Informatics · doi:10.1016/j.aei.2026.105296
Abboodi, A. A., Alkiffai, A. N., & Yassein, H. R. (2026) · Boletim da Sociedade Paranaense de Matemática · doi:10.5269/bspm.79624
Nanopore Sequencing Channel Modeling and Adaptive Dual-Track Decoding Framework for DNA Data Storage
Zeng, Y., Gong, R., Li, Y., Fang, Y., & Han, G. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3740116
“System-level archival frameworks such as DNA Fountain [21] use rateless erasure codes to recover missing strands under severe dropout.”
From Pixels to Nucleotides: End-to-End Token-Based Video Compression for DNA Storage
Ruan, C., Zhou, L., Zhao, B., Han, R., Yuan, Q., Zhu, C., Han, L., Yang, L., Wang, W., Jiang, W., et al. (2026) · doi:10.1109/cvprf71909.2026.00820
“Prior schemes [7, 8] introduce redundancy—padding, sequence rejection, or constraint-enforcing codes—to satisfy biochemical requirements, reducing practical encoding density to 1.5-1.6 bpn (bits per nucleotide).”
InfluentialSong, Y., Wang, Z., Wu, H., Zhao, X., Zhou, Y., Lu, Z., Tu, J., & Bi, K. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7589372
Archival data storage using DNA proximity graphsPreprint
Perry, E., Tiepelt, J., & Jacobson, J. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.10.12.758707
“Assuming an encoding efficiency of 1.5 bits per base 9 , commercial phosphoramidite synthesis by Twist Bioscience (inkjet) and GenScript (CMOS) costs approximately $1.7 million and $287,000/GB, respectively.”
InfluentialCMC: constrained mixed-radix coding tools for DNA storage of Chinese text
Shi, L., Li, Z., Zheng, Y., Li, X., Mu, Z., Zhou, S., Cao, B., Wang, B., & Lai, E. M. K. (2026) · Frontiers of Computer Science · doi:10.1007/s11704-026-60971-6
Data storage with amino acid sequences
Zhou, Y., Ng, C. C. A., & Yao, Z. (2026) · Trends in biotechnology · doi:10.1016/j.tibtech.2026.09.021
Rebimbas, R., Glória, I., Chegão, J., Al-Rawi, M., Mousakhani Ganjeh, A., & Saraiva, J. A. (2026) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2026.03.003
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.