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 701–800 of 894
Robust retrieval of data stored in DNA by de Bruijn graph-based de novo strand assemblyPreprint
Song, L., Geng, F., Gong, Z.-Y., Chen, X.-M., Tang, J., Gong, C., Zhou, L., Xia, R., Han, M., Xu, J., et al. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.12.20.423642 · Cited by 1
New Levenshtein-Marker Code for DNA-based Data Storage Capable of Correcting Multiple Edit ErrorsPreprint
Yan, Z., & Liang, C. (2021) · doi:10.36227/techrxiv.15022779 · Cited by 1
A super robust and efficient DNA storage architecture based on modulation encoding and decodingPreprint
Zan, X., Xie, R., Yao, X., Xu, P., & Liu, W. (2022) · Research Square · doi:10.21203/rs.3.rs-1691759/v1 · Cited by 1
Modular DNA-origami-based nanoarrays enhanced cell binding-affinity through “lock-key” interactionPreprint
Mao, M., Lin, Z., Chen, L., Zou, Z., Zhang, J., Dou, Q., Wu, J., Chen, J., Wu, M., Niu, L., et al. (2022) · Research Square · doi:10.21203/rs.3.rs-2148903/v1 · Cited by 1
A Superior “Thumb” Drive: Optimizing DNA Stability for DNA Data StoragePreprint
Liu, J.-Y. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.05.11.540302 · Cited by 1
Jiang, L., Zou, Z., Ruan, X., Zhang, X., Yu, X., Lan, Y., & Liu, X. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.07.11.548641 · Cited by 1
Yunfei, L., & Xuncai, Z. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.09.27.559852 · Cited by 3
Post-Translational Digital Data Encoding into the Genomes of Mammalian Cell PopulationsPreprint
Callisto, A., Strutz, J., Leeper, K., Kalhor, R., Church, G. M., Tyo, K. E. J., & Bhan, N. (2024) · SSRN Electronic Journal · doi:10.1101/2024.05.12.591851 · Cited by 1
Self-Authenticating Genomic Materials with Advanced Genome SignaturesPreprint
Wang, Z., Cui, J., Liu, Q., Li, J., Guo, C., Liu, Y., Jiang, C., Xue, H., Li, J. J., Ke, Y., et al. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.11.02.621633 · Cited by 1
“Continuous and unpredictable mutations can lead to the loss of information encoded in DNA tags, even with existing error-correction methods ( Table S1 )( 14-16 ).”
BackgroundMao, C., Zheng, S., Huang, Z., Wang, D., Zhuang, Y., Zhang, J., Wang, R., & Jiang, X. (2025) · ACS Nano · doi:10.1021/acsnano.5c08183 · Cited by 1
A biologically constrained encoding solution for long-term storage of images onto synthetic DNA
Dimopoulou, M., Antonini, M., Barbry, P., & Appuswamy, R. (2019) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2019.8902583 · Cited by 39
“Other studies [4], [5] suggest the use of Reed-Solomon code in order to treat the erroneous sequences while in [6] a new robust method of encoding has been proposed to approach the Shannon capacity.”
MethodBall, P. (2017) · Nature Materials · doi:10.1038/nmat4887
Kmiecik, J., Wójcik, K., Kułakowski, P., & Jajszczyk, A. (2018) · arXiv (Cornell University)
Commentary on Recent Development of Biological Computer
Lin, C. L., & Li, W. X. (2018) · Journal of Phylogenetics & Evolutionary Biology · doi:10.4172/2329-9002.1000195
“Erlich and Zielinski stated that the theoretical information storage capacity of DNA is up to 680 petabytes per gram [14].”
BackgroundNext-Generation data storage: Transistor and DNA
Ashrafi, R. A., Pusane, A. E., & Arslan, Ş. S. (2018) · Signal Processing and Communications Applications Conference (SIU) · doi:10.1109/siu.2018.8404428
“In other words, although in living cells DNA strands can possibly be made of several millions of nucleotide bases, recent state-ofthe-art studies have been only able to store and retrieve digital data on DNA molecules, which were around few hundred nucleotides long [18], [19], [20].”
BackgroundWenn ich nur wüsste, was ich weiß oder die DNA als Speichermedium
Hahn, J. (2018) · Springer eBooks · doi:10.1007/978-3-658-23297-9_20
Locatelli, A. (2018) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/yj8xw
TCTGCTTAT ATTACT TGGATTACTCAT GATAATGCT
Häfner, S. J. (2018) · Microbes and Infection · doi:10.1016/j.micinf.2018.11.002
DNA Based Storage: Introduction, Characteristics, Applications and Challenges
Sharma, D., Kumar, S., & Kumar, A. (2018) · International Journal of Machine Learning and Networked Collaborative Engineering · doi:10.30991/ijmlnce.2018v02i04.003
“Later in [14], researchers at Columbia University by the name of Dina Zielinski and Yaniv Erlich along with New York Genome Centre published a new technique called DNA fountain, using which they were able to store a complete Operating Systems and related files, that had a data storage density of…”
A Synthetic Signal Varied Weight Indicator in Bacteria
Chen, M. (2019) · IEEE Access · doi:10.1109/access.2019.2921400
“A lot of biomolecular computing devices, such as logic gates [5], cellular recorders [6]–[8], digital information storage devices [9], [10], arithmetic logic units [11], digital comparator [12], adder and subtractor [13], [14], NP-problem solving devices [15], as well as bacteria and plasmid computing systems [16], ha…”
BackgroundCRISPR-Cas technology: A role in Transcriptional recording and chromatin remodeling events
Sharma, N. K. (2019) · Current Chemical Biology · doi:10.2174/2212796813666190823091033
Blockchain of Signature Material Combining Cryptographic Hash Function and DNA SteganographyPreprint
Zhang, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.07914 · Cited by 2
Hiding Secret Messages in Living Cells in the Age of Next-Generation Sequencing
Chen, M. (2019) · IEEE Access · doi:10.1109/access.2019.2961105 · Cited by 1
Носії довготермінового зберігання даних
Петров, В. В., Kryuchyn, A. A., Belyak, E. V., & Shikhovets, О. V. (2018) · Реєстрація зберігання і обробка даних · doi:10.35681/1560-9189.2018.20.3.158507
Mixed Culture of Bacterial Cell for Large Scale DNA StoragePreprint
Hao, M., Qiao, H., Gao, Y., Wang, Z., Qiao, X., Chen, X., & Qi, H. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.02.21.960476
Affizierungs- und Teilhabeprozesse zwischen Organismen und Maschinen
(2020) · Technikzukünfte, Wissenschaft und Gesellschaft · doi:10.1007/978-3-658-27164-0
Ein inneres Verständnis des Lebens aus der Physik heraus?
Janjic, A. (2021) · Springer eBooks · doi:10.1007/978-3-662-62373-2_3
Nanopore Decoding for DNA Computing
Yasuga, H., Shoji, K., & Kawano, R. (2021) · doi:10.1002/9783527825424.ch17
Intelligent Messages in Bacterial DNA – a Sequel to SETI?
Wickramasinghe, N. C., Tokoro, G., & Temple, R. (2021) · Advances in Astrophysics · doi:10.22606/adap.2021.61001
Addressing Information Using Data Hiding for DNA-based Storage Systems
Ota, T., & Manada, A. (2020) · International Symposium on Information Theory and its Applications
Information-theoretic problems of DNA-based storage systems
Kruglik, S., Kucherov, G., Nazirkhanova, K., & Filitov, M. (2021) · Информационно-управляющие системы · doi:10.31799/1684-8853-2021-3-39-52
New Levenshtein-Marker Code for DNA-based Data Storage Capable of Correcting Multiple Edit ErrorsPreprint
Yan, Z., & Liang, C. (2021) · doi:10.36227/techrxiv.15022779.v1
АНАЛІЗ МОЖЛИВОСТЕЙ ДОВГОСТРОКОВОГО ЗБЕРІГАННЯ ДАНИХ НА ДНК
Крючин, А. А., Беляк, Є. В., Крючина, Є. А., & Shikhovets, О. V. (2021) · Medical Informatics and Engineering · doi:10.11603/mie.1996-1960.2020.3.12390
Generation of DNA Strands Representing Handwritten Numbers Based on GAN
Dong, J. (2021) · IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA) · doi:10.1109/aeeca52519.2021.9574373
(2020) · Flammarion eBooks · doi:10.3917/flam.munro.2020.01.0292
Future Computing: DNA Hard Drives
Hasan, M. Z., Hussain, M. Z., Ullah, Z., & Hassan, T. (2019) · Lahore Garrison University Research Journal of Computer Science and Information Technology · doi:10.54692/lgurjcsit.2019.030165
Using codes in place of DNA Sample in Databases to reduce Storage
Zahra, S. E., Abbas, S., & Altaf, T. (2020) · Lahore Garrison University Research Journal of Computer Science and Information Technology · doi:10.54692/lgurjcsit.2019.030386
“…second array (b) and the result will be: [0]37 , [1]223 , [2]222 , [3]1 , [4]218 , [5]115 , [6]46 , [7]135 , [8]243 , [9]108 , [10]44 , [11]245 , [12]163 , [13]58 , [14]3 , [15]195 , [16]84 , [17]182 , [18]19 , [19]12 , [20] In the second phase we convert binary no's into numeric array index…”
Wang, Y. (2021) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/155241
Oligo replication advantage driven by GC content and Gibbs free energyPreprint
Qi, H., Qiao, H., Gao, Y., Wei, Y., Li, J., Liu, Q., & Wang, Z. (2022) · Research Square · doi:10.21203/rs.3.rs-1502541/v1
Reconstruction of encoded data in DNA storage technology
Sankar, S. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/156818
CRISPR-Cas Technology: A Role in Transcriptional Recording and Chromatin Remodeling Events
Sharma, N. K. (2019) · Current Chemical Biology · doi:10.2174/2212796813999190823154354
Faculty Opinions recommendation of Demonstration of End-to-End Automation of DNA Data Storage.
Villard, L. (2019) · Faculty Opinions – Post-Publication Peer Review of the Biomedical Literature · doi:10.3410/f.735368249.793559474
Storing data in the backbone of DNAPreprint
Superville, S. (2020) · doi:10.22541/au.157953797.78859434
Can we prove the existence of God using quantitative biology ? RetractedPreprint
Locatelli, T. (2018) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/q9xzj
RetractedHighly Parallel Oligonucleotide Libraries Purification
Choi, H. (2022) · Springer theses · doi:10.1007/978-981-19-4274-7_3
An image cryptography method in highly error-prone DNA storage channelPreprint
Zan, X., Xie, R., Chu, L., Su, Y., Yao, X., Xu, P., & Liu, W. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.11.08.515529
“Currently, researchers have devoted huge efforts to accurately recover information from the noised sequence pool [3-7].”
BackgroundCharacterizing Wildfire in the Frank Church Wilderness, Idaho, Between 1972-2012
Llewellyn, S. (2022) · ScholarWorks (Boise State University) · doi:10.18122/td.2008.boisestate
DNA computing-based Big Data storage
Sharma, D., & Ramteke, M. (2022) · Advances in computers · doi:10.1016/bs.adcom.2022.08.005 · Cited by 1
A method for storing information in DNA with improved dropout tolerancePreprint
Mortuza, G. M., Tobiason, M. D., Suyehira, K., Hughes, W. L., Andersen, T., & Zadegan, R. M. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.06.20.545769
Data recovery methods for DNA storage based on fountain codesPreprint
Schwarz, P. M., & Freisleben, B. (2023) · Research Square · doi:10.21203/rs.3.rs-3252364/v1
Autoturbo-DNA: Turbo-Autoencoders for the DNA data storage channelPreprint
Welzel, M., Dreßler, H., & Heider, D. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.09.15.557887
Muttaqin, M. R., Herdiyeni, Y., Buono, A., Priandana, K., & Siregar, I. Z. (2023) · International Journal of Advances in Intelligent Informatics · doi:10.26555/ijain.v9i3.1063 · Cited by 2
“The cost of DNA synthesis and sequencing [11] As a result of multimedia and communication technology advancement, multimedia entertainment plays a crucial role in contemporary human life.”
BackgroundResultInfluentialAn Extension of DNAContainer with a Small Memory Footprint
El-Shaikh, A., & Seeger, B. (2023) · Datenbank-Spektrum · doi:10.1007/s13222-023-00460-3
DNA-Based Storage of RDF Graph Data: A Futuristic Approach to Data Analytics
Usmani, A. R., & Wiese, L. (2023) · IEEE Access · doi:10.1109/access.2023.3332254 · Cited by 1
“By incorporating all the factors discussed above, we developed a DNA strand structure based on the DNA Fountain strategy devised earlier [42].”
MethodAdaptable DNA Storage Coding: An Efficient Framework for Homopolymer Constraint Transitions
Gao, Y., & No, A. (2024) · IEEE Access · doi:10.1109/access.2024.3353305 · Cited by 2
“When it comes to encoding binary sequences into DNA sequences, Erlich et al. [3] propose a theoretical rate limit considering homopolymer constraints of h .”
BackgroundMethodInfluentialData recovery methods for DNA storage based on fountain codesPreprint
Schwarz, P. M., & Freisleben, B. (2024) · Research Square · doi:10.21203/rs.3.rs-3252364/v2
Shotgun sequencing of 512-mer copolyester allows random access to stored informationPreprint
Kim, K. T., Jang, H., Chu, H., & Noh, H. (2024) · Research Square · doi:10.21203/rs.3.rs-3874611/v1
A novel approach to encode melodies in DNA
Kiryanova, O. Y., Гарафутдинов, Р. Р., Gubaydullin, I. M., & Chemeris, A. V. (2024) · Biosystems · doi:10.1016/j.biosystems.2024.105136
Codecs for DNA-based Data Storage Systems with Multiple Constraints for Internet of Things
Fan, K., Wu, H., & Li, R. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437031 · Cited by 1
“Recently, the global GC-content constraint has been widely studied in the literature [3]–[7].”
BackgroundD2Sim: A Computational Simulator for Nanopore Sequencing Based DNA Data Storage
Sankar, S., Yixin, W., Noor‐A‐Rahim, M., Gunawan, E., Guan, Y. L., & Poh, C. L. (2026) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2026.3716589
“Their experiments indicated that with a size parameter of r = 7 and a coverage size of 7, a low drop-out rate of 0.5% can be achieved [3].”
InfluentialEtzion, T. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-313517-0.00014-7
Convolutional Codes Based Index-Free Coding Strategy for High-Density DNA Storage
Chen, W., Zhang, Z., Liu, Z., & Xu, F. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-2272-3_30 · Cited by 2
An Efficient Encoding Mechanism for Digital Microfluidic-based DNA Data Storage SystemsPreprint
Pourasadollah, M., Taajobian, M., & Jahanian, A. (2024) · Research Square · doi:10.21203/rs.3.rs-4263925/v1
DNA Archives: Revolutionizing Data Storage
Patel, R., Garg, D., Shah, M., Dharmajwala, S., Jindal, K., & Nayak, A. (2023) · International Conference on Innovative Mechanisms for Industry Applications · doi:10.1109/icimia60377.2023.10426397 · Cited by 1
“It has been suggested by Y. Erlich and colleagues [18] that DNA can store considerable information.”
BackgroundIntroductions of Nucleic Acid‐Based Nanomaterials
Gao, S., & Lin, Y. (2024) · Wiley eBooks · doi:10.1002/9783527841912.ch1
Efficient DNA Coding Algorithm for Polymerase Chain Reaction Amplification Information Retrieval
Wang, Q., Zhang, S., & Li, Y. (2024) · International Journal of Molecular Sciences · doi:10.3390/ijms25126449
DNA Transcription and Translation Inspired Deep Features for Classification-Based CBIR
Pradhan, J., Pal, A. K., Islam, S. H., & Samanta, D. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-64847-2_25
On Permutation Capacity Regions of Multiple-Access Channels
Lu, W., & Makur, A. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619563
Biochemical approaches for decoding the information stored with metabolites
Tong, Z., Hou, S., Zhang, Z., Liu, Z., & Zhang, Y. (2024) · Sensors and Actuators B Chemical · doi:10.1016/j.snb.2024.136618
“Galaxy” Encoding: Toward High Storage Density and Low Cost
Zhang, X., & Lu, Y. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3481504
“In 2017, Erlich et al. [14] proposed the “fountain code” algorithm, which screens droplets for homopolymers and GC content anomalies, achieving a net information density of 1.57 bits/nt.”
InfluentialDNA-SaM, a robust system for large-scale data storagePreprint
Huang, X., Wang, Y., Xu, J., Nie, Z., Huang, J., Wu, Y., Qin, Z., Dai, J., & Wang, Y. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.11.04.621825
Yan, Z., Qu, G., Chen, X., Zheng, G., & Wu, H. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.11.07.622581
Flors, V., Cerveró, R., Tinajero, C., Sans, V., & Vicent, C. (2025) · The Analyst · doi:10.1039/d5an00353a · Cited by 1
DNA framework array enables ultra-high throughput DNA synthesisPreprint
Li, C., Saimaiti, Y., Li, M., Wang, S., Yin, F., Fang, Z., Jia, S., Wang, F., Ye, D., Wang, L., et al. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.05.30.657018 · Cited by 1
Primer‐Disk‐Enabled DNA Data Storage System with Index and Record‐Many‐Read‐Many Features
Ma, J., Yu, Y., Pei, B., Mi, S., Xiong, Z., & Ouyang, L. (2025) · Advanced Science · doi:10.1002/advs.202502367 · Cited by 2
Demonstration of a Scalable DNA Computing Platform: Writing and Selection
Bhatia, S. P., Ramliden, M. S., Rao, V., Vezeau, G. E., Katz‐Christy, N., Tolkamp, S., O’Leary, M., Jayne, H., Rockwood, T., Pradeep, R. R. K., et al. (2025) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3744562
“Work on optimizing data storage systems using basewise encoding includes automating the process [71] and improving scalability via error correction [10, 28].”
Research Progress on Nucleic Acid Information Material
Song, L., Li, M., & Zuo, X. (2025) · 中国科学基金 · doi:10.3724/bnsfc-2025.02.19.0002
Wu, W., Xiang, L., Liu, Q., & Yang, K. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-8731-2_20
Nano Disque Chimique RDC-1000: Towards a Novel Molecular Approach for Data StoragePreprint
Ndenga, B. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5350043
Ramp Secret Sharing for Composite DNA
Zhang, W., & Wang, Z. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3593447 · Cited by 2
“Afterwards, the DNA samples are sequenced and decoded to retrieve the original information [1], [2], [3], [4], [5], [6], [7].”
Ge, C., Dong, X. N., & Xue, Z. (2025) · Journal of Membrane Computing · doi:10.1007/s41965-025-00202-2 · Cited by 2
A virtual multi-level directory file addressing method (VMDFAM) for DNA storage
Zan, X., Yao, X., Chu, L., Xu, P., & Liu, W. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.108051
DNA Sequence Trace Reconstruction Using Deep LearningPreprint
Cao, B., Xie, L., Liu, Z., Li, X., Wang, B., Zhou, S., Zheng, P., & Zhang, Q. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.08.05.668822 · Cited by 2
“In DNA sequences that contain data or species information, DNA fragments representing specific information (e.g., data indexes, error-correcting code redundancy, core promoters, and translation initiation sites) are usually located in fixed regions [45-48].”
Natural Biopolymers and Biopolymer Manufacturing
Zhang, W. (2025) · Synthesis lectures on chemical engineering and biochemical engineering · doi:10.1007/978-3-031-98868-4_3
A High Capacity and Efficient Retrieval Database System for DNA-Based Data Storage
Zhang, Z., Liu, Z., & Xu, F. (2025) · Communications in computer and information science · doi:10.1007/978-981-96-9585-0_12
6-Base Huffman Compression Rotation Coding for High Density DNA Data Storage
Xu, F., Huang, S., & Chen, W. (2025) · Communications in computer and information science · doi:10.1007/978-981-96-9585-0_4
Improved Homopolymer-Free Encoding for DNA Storage SystemsPreprint
Hojatizadeh, V., & Jahanian, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5402957
Quality and Cost Improved Renewable Time-Responsive DNA Logic Gates
Zolfaghari, M. A., & Jahanian, A. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3569127
“Nowadays, DNA strands are used in a wide range of applications such as data-storage [2], [3], [4], [5], Boolean logic gates [6], [7] and [8], DNA cryptography [9] and DNA-based nanorobots [10].”
Storing data in DNA brings nature into the digital universe
Ceze, L., & Strauß, K. (2017) · The Conversation · doi:10.64628/aai.5hyrfknj6
Zhang, J., Chen, L., Sun, J., Li, S., Zhou, Y., Wu, Z., Li, C., Zheng, Z., & Luo, R. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.08.29.673174
“Unlike many other DNA codec systems 11, 12, 13, 14, 15, 16 , Gungnir treats sequence addresses as unknown information to be guessed rather than explicitly encoded data.”
Research progress of the reliability of DNA data storage
XueQing, Y. U. E., ZHENG, Z., RuiYing, C. A. O., PengHua, Z. H. O. U., & Chen, X. (2025) · Scientia Sinica Vitae · doi:10.1360/ssv-2025-0200
Geno-Weaving: A Framework for Low-Complexity Capacity-Achieving DNA Data Storage
Wang, H.-P., & Guruswami, V. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3610643 · Cited by 4
“D NA molecules are considered a data storage medium [1], [2], [3], [4], [5], [6], [7] with immense potential for their nano-scale size and centurial (or even millennial [8]) durability.”
Graph Constructions of Error-Detecting Codes for Nanopore Sequencers
Piwowarczyk, M., & Kelley, C. A. (2025) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc65386.2025.11154506
“(C1): Balanced GC-content: The available strands of DNA should have a concentration of approximately 45-55% C ’s and G ’s [17].”
DNA Data Storage Architecture via Ligation of Dynamic DNA BytesPreprint
Jia, L., Shi, Y., Yang, J., Li, S., Yang, W., Li, W., Zhang, M., Li, Q., Zhang, Y., Wang, X., et al. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.09.15.676197
Bounding the Capacity of the Multinomial Channel Using KL Divergence Covering and Packing
Tang, J. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195475 · Cited by 1
“Thus, a significant amount of research effort has been put into understanding coding strategies for DNA storage systems in attempt to understand how to design systems to improve the storage rates [8]–[11].”
A New Lower Bound for Noisy Permutation Channels via Divergence Packing
Feng, L., Lv, G., Li, X., & Jin, Y. (2025) · Entropy · doi:10.3390/e27111101 · Cited by 1
Progressive decoding of DNA-stored JPEG data with on-the-fly error correctionPreprint
Nawaz, I., Agarwal, P., & Heinis, T. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.10.26.684640
“Fountain codes, like Luby Transform (LT) codes [28], are near-optimal rateless erasure codes and are able to approach the DNA storage channel capacity while providing greater robustness against erasures [14].”
Randomized DNA Base Sequence Design by Using Degenerate Bases for DNA Data Storage
Seo, S., Tandon, A., Nguyen, T. B. N., Vu, T. H. N., Lee, K. W., & Park, S. H. (2025) · ACS Applied Bio Materials · doi:10.1021/acsabm.5c01680 · Cited by 1
Programming Escherichia coli to Understand Compositional Syntax
陈, 梅. (2025) · Hans Journal of Biomedicine · doi:10.12677/hjbm.2025.156117
“随着 DNA 技术的飞速发展,近年来已成功构建出多种适用于体外和体内的 DNA 电路。这些 DNA 电路可广泛应用于逻辑计算 [1]-[3] 、数据存储 [4] [5] 、并行计算 [6] 、传感器 [7] 及智能计算 [8]”
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.