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 201–300 of 894
Launay, 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 International Edition · doi:10.1002/anie.202010171 · Cited by 26
FMG: An observable DNA storage coding method based on frequency matrix game graphs
Cao, B., Shi, P., Zheng, Y., & Zhang, Q. (2022) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2022.106269 · Cited by 23
Wu, W., Xiang, L., Liu, Q., & Yang, K. (2023) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2023.3331579 · Cited by 29
“Restrictions apply. algorithms for error correction [9], [12], [15], [16], [17].”
BackgroundBio-Constrained Codes with Neural Network for Density-Based DNA Data Storage
Rasool, A., Qu, Q., Wang, Y., & Jiang, Q. (2022) · Mathematics · doi:10.3390/math10050845 · Cited by 26
“it found error propagation in the information retrieval stage [3].”
BackgroundMethodInfluentialDeSP: a systematic DNA storage error simulation pipeline
Yuan, L., Xie, Z., Wang, Y., & Wang, X. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04723-w · Cited by 25
“Here, we provide a case for choosing the proper redundancy level for the DNA fountain code [5] as an example (Fig.”
MethodLuo, Y., Wang, S., Feng, Z., Li, J., Mao, C., Wang, R., & Jiang, X. (2022) · Analytical Chemistry · doi:10.1021/acs.analchem.2c02667 · Cited by 23
Is a Data-Capacity Gap Inevitable in Big Data Storage?
Bhat, W. A. (2018) · Computer · doi:10.1109/mc.2018.3620975 · Cited by 24
New chaotical image encryption algorithm based on Fisher–Yatess scrambling and DNA coding
Wang, X., Zhang, J., Zhang, F., & Cao, G. (2019) · Chinese Physics B · doi:10.1088/1674-1056/28/4/040504 · Cited by 27
Constrained Coding with Error Control for DNA-Based Data Storage
Nguyen, T. T., Cai, K., Immink, K. A. S., & Kiah, H. M. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174438 · Cited by 25
“[4]).”
DNA-based data storage via combinatorial assemblyPreprint
Roquet, N., Bhatia, S. P., Flickinger, S. A., Mihm, S., Norsworthy, M. W., Leake, D., & Park, H. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.04.20.440194 · Cited by 29
Recent Progress in High-Throughput Enzymatic DNA Synthesis for Data Storage
Baek, D. J., Joe, S.-Y., Shin, H., Park, C., Jo, S., & Chun, H. (2024) · BioChip Journal · doi:10.1007/s13206-024-00146-2 · Cited by 25
“Various strategies have been employed for error correction, such as Reed–Solomon code, Fountain codes, and low-density parity check (LDPC) [59–61].”
Cryptographic approaches to authenticating synthetic DNA sequences
Berezin, C.-T., Peccoud, S., Kar, D. M., & Peccoud, J. (2024) · Trends in biotechnology · doi:10.1016/j.tibtech.2024.02.002 · Cited by 28
“DNA is a robust storage medium capable of long-term data storage: books, songs, even operating systems can be stored in DNA [16,17].”
Zhao, X., Li, J., Fan, Q., Dai, J., Long, Y., Liu, R., Zhai, J., Pan, Q., & Li, Y. (2024) · Nature Communications · doi:10.1038/s41467-024-53455-3 · Cited by 27
Transducing Protease Activity into DNA Output for Developing Smart Bionanosensors
Bui, H., Brown, C. W., Buckhout‐White, S., Díaz, S. A., Stewart, M. H., Susumu, K., Oh, E., Ancona, M. G., Goldman, E. R., & Medintz, I. L. (2019) · Small · doi:10.1002/smll.201805384 · Cited by 22
Reconstruction of Sequences in DNA Storage
Abu-Sini, M., & Yaakobi, E. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849740 · Cited by 27
“in [5], [6], [8], [14], [19]–[21].”
IMG-DNA: approximate DNA storage for images
Li, B., Ou, L., & Du, D. H.-C. (2021) · ACM International Conference on Systems and Storage · doi:10.1145/3456727.3463771 · Cited by 29
Capacity of the Torn Paper Channel with Lost Pieces
Ravi, A. N., Vahid, A., & Shomorony, I. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518272 · Cited by 27
The emerging landscape of microfluidic applications in DNA data storage
Luo, Y., Cao, Z., Liu, Y., Zhang, R., Yang, S., Wang, N., Shi, Q., Li, J., Dong, S., Fan, C., et al. (2023) · Lab on a Chip · doi:10.1039/d2lc00972b · Cited by 22
Lau, B. T., Chandak, S., Roy, S., Tatwawadi, K., Wootters, M. K., Weissman, T., & Ji, H. P. (2023) · Scientific Reports · doi:10.1038/s41598-023-29575-z · Cited by 29
“Recent work has shown it is possible to re-amplify DNA oligonucleotide pools (9) but an ideal solution would be potentially lossless reading of a file from the source DNA.”
BackgroundMethodResultInfluentialA biological camera that captures and stores images directly into DNA
Lim, C. K., Yeoh, J. W., Kunartama, A. A., Yew, W. S., & Poh, C. L. (2023) · Nature Communications · doi:10.1038/s41467-023-38876-w · Cited by 26
How to make DNA data storage more applicable
Akash, A., Bencúrová, E., & Dandekar, T. (2023) · Trends in biotechnology · doi:10.1016/j.tibtech.2023.07.006 · Cited by 27
CRISPR-powered quantitative keyword search engine in DNA data storage
Zhang, J., Hou, C., & Liu, C. (2024) · Nature Communications · doi:10.1038/s41467-024-46767-x · Cited by 26
Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
Walter, F., Sabary, O., Wachter-Zeh, A., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619202 · Cited by 33
Sc-ncDNAPred: A Sequence-Based Predictor for Identifying Non-coding DNA in Saccharomyces cerevisiae
He, W., Ju, Y., Zeng, X., Liu, X., & Zou, Q. (2018) · Frontiers in Microbiology · doi:10.3389/fmicb.2018.02174 · Cited by 22
“Especially, with the rapid growth and development of synthetic biology, research in the genomics is advancing from genome sequencing to genome synthesis (Erlich and Zielinski, 2017; Jain et al., 2018; Liu B. et al., 2018).”
BackgroundBuko, T., Tuczko, N., & Ishikawa, T. (2023) · BioTech · doi:10.3390/biotech12020044 · Cited by 21
“Erlich and Zielinski (2017) used the fountain algorithm to encode 2.14 × 10 6 bytes of data [35].”
BackgroundMethodInfluentialThe zettabyte era is in our DNA
Bar-Lev, D., Sabary, O., & Yaakobi, E. (2024) · Nature Computational Science · doi:10.1038/s43588-024-00717-1 · Cited by 30
“Other approaches to data retrieval utilize only the noise-free reads for the decoding process 30,31 .”
Hidden Addressing Encoding for DNA Storage
Wang, P., Mu, Z., Sun, L., Si, S., & Wang, B. (2022) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2022.916615 · Cited by 27
“In the fountain encoding scheme, Erlich and Zielinski (2017) used the seed as the index of the sequence to restore the original fi le.”
BackgroundMethodCatalytic DNA‐Assisted Mass Production of Arbitrary Single‐Stranded DNA
Zhang, Q., Xia, K., Jiang, M., Li, Q., Chen, W., Han, M., Li, W., Ke, R., Wang, F., Zhao, Y., et al. (2022) · Angewandte Chemie International Edition · doi:10.1002/anie.202212011 · Cited by 27
Capacity of Noisy Permutation Channels
Tang, J., & Polyanskiy, Y. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3247812 · Cited by 25
“b) DNA Storage Systems: DNA-based storage systems are an attractive option for data storage due to its ability to withstand time and encode a very high-density of information [10], [11].”
BackgroundHigh Net Information Density DNA Data Storage by the MOPE Encoding Algorithm
Zheng, Y., Cao, B., Wu, J., Wang, B., & Zhang, Q. (2023) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2023.3263521 · Cited by 23
Advances and Challenges in Random Access Techniques for In Vitro DNA Data Storage
Zhou, Y., Bi, K., Ge, Q., & Lu, Z. (2024) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.4c07235 · Cited by 23
An Effective DNA‐Based File Storage System for Practical Archiving and Retrieval of Medical MRI Data
Rasool, A., Hong, J., Hong, Z., Li, Y., Zou, C., Chen, H., Qu, Q., Wang, Y., Jiang, Q., Huang, X., et al. (2024) · Small Methods · doi:10.1002/smtd.202301585 · Cited by 27
Cost‐Effective DNA Storage System with DNA Movable Type
Wang, C., Wei, D., Wei, Z., Yang, D., Xing, J., Wang, Y., Wang, X., Wang, P., Ma, G., Zhang, X., et al. (2024) · Advanced Science · doi:10.1002/advs.202411354 · Cited by 28
CLGBO: An Algorithm for Constructing Highly Robust Coding Sets for DNA Storage
Zheng, Y., Wu, J., & Wang, B. (2021) · Frontiers in Genetics · doi:10.3389/fgene.2021.644945 · Cited by 22
“In 2017, Erlich and Zielinski (2017) stored a complete computer-operating system, movies and other files in a DNA sequence with a total size of 2.14 × 10 6 bytes.”
BackgroundInfluentialCoding for Segmented Edits with Local Weight Constraints
Cai, K., Kiah, H. M., Motani, M., & Nguyen, T. T. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517851 · Cited by 23
Park, S., Lee, Y., & No, J. (2022) · Journal of Communications and Networks · doi:10.23919/jcn.2022.000008 · Cited by 24
On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes
Nguyen, T. T., Cai, K., Kiah, H. M., Dao, D. T., & Immink, K. A. S. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206972 · Cited by 23
BO-DNA: Biologically optimized encoding model for a highly-reliable DNA data storage
Rasool, A., Hong, J., Jiang, Q., Chen, H., & Qu, Q. (2023) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2023.107404 · Cited by 25
Nerantzaki, M., Husser, C., Ryckelynck, M., & Lutz, J. (2024) · Journal of the American Chemical Society · doi:10.1021/jacs.3c13953 · Cited by 21
Cao, B., Wang, K., Xie, L., Zhang, J., Zhao, Y., Wang, B., & Zheng, P. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae463 · Cited by 21
“[7] introduced fountain encoding with fault tolerance, which treats synthesized DNA fragments as packets in a data stream, thus achieving efficient DNA data storage.”
BackgroundOrthogonal Information Encoding in Living Cells with High Error-Tolerance, Safety, and Fidelity
Song, L., & Zeng, A. (2018) · ACS Synthetic Biology · doi:10.1021/acssynbio.7b00382 · Cited by 18
Oligo Design with Single Primer Binding Site for High Capacity DNA-Based Data Storage
Wang, Y., Noor‐A‐Rahim, M., Zhang, J., Gunawan, E., Guan, Y. L., & Poh, C. L. (2019) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2019.2940177 · Cited by 21
“Polymerase Chain Reaction (PCR) was performed as an universal process in the previous works [3], [5], [6], [7], [8], [9], [10], [11], [12].”
BackgroundMethodInfluentialRecent progress in DNA data storage based on high-throughput DNA synthesis
Jo, S., Shin, H., Joe, S.-Y., Baek, D. J., Park, C., & Chun, H. (2024) · Biomedical Engineering Letters · doi:10.1007/s13534-024-00386-z · Cited by 29
“Erlich and Zielinski optimized data density by analyzing information capacity of the DNA data storage process [26].”
A self-contained and self-explanatory DNA storage system
Li, M., Wu, J., Dai, J., Jiang, Q., Qu, Q., Huang, X., & Wang, Y. (2021) · Scientific Reports · doi:10.1038/s41598-021-97570-3 · Cited by 24
Mini review: Enzyme-based DNA synthesis and selective retrieval for data storage
Yoo, E., Choe, D., Shin, J., Cho, S., & Cho, B. (2021) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2021.04.057 · Cited by 24
Ravi, A. N., Vahid, A., & Shomorony, I. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3151737 · Cited by 26
Highly reliable and efficient encoding systems for hexadecimal polypeptide-based data storage
Ren, Y., Zhang, Y., Liu, Y., Wu, Q., Hu, H., Li, J., Fan, C., Chen, D., Liu, K., & Zhang, H. (2021) · Fundamental Research · doi:10.1016/j.fmre.2021.11.030 · Cited by 19
Engineered Spore-Forming Bacillus as a Microbial Vessel for Long-Term DNA Data Storage
Liu, F., Li, J., Zhang, T., Chen, J., & Ho, C. L. (2022) · ACS Synthetic Biology · doi:10.1021/acssynbio.2c00291 · Cited by 19
Liu, K., Xing, R., Sun, R., Ge, Y., & Chen, Y. (2022) · Foods · doi:10.3390/foods12010017 · Cited by 23
“Information redundancy is incorporated into the synthesis process to ensure accurate reading, increasing the cost of synthesis [15].”
A Tutorial on Coding Methods for DNA-Based Molecular Communications and Storage
Xiang, L., Liu, Q., Chen, S., Yan, K., Wu, W., & Yang, K. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3332903 · Cited by 27
“2) Using RS codes as outer codes together with other codes that can correct insertion and deletion errors as inner codes, such as fountain codes [12], [25] and HEDGES [14].”
BackgroundMethodInfluentialGenetic programs can be compressed and autonomously decompressed in live cells
Lapique, N., & Benenson, Y. (2017) · Nature Nanotechnology · doi:10.1038/s41565-017-0004-z · Cited by 19
Rapid Visual Authentication Based on DNA Strand Displacement
Berk, K. L., Blum, S. M., Funk, V. L., Sun, Y., Yang, I.-Y., Gostomski, M. V., Roth, P. A., Liem, A. T., Emanuel, P. A., Hogan, M. E., et al. (2021) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.1c02429 · Cited by 21
DNA storage: The future direction for medical cold data storage
Shen, P., Zheng, Y., Zhang, C., Li, S., Chen, Y., Chen, Y., Liu, Y., & Cai, Z. (2025) · Synthetic and Systems Biotechnology · doi:10.1016/j.synbio.2025.03.006 · Cited by 19
“To address biological restrictions, coding algorithms with biological filtering have been developed, such as the Base64 coding algorithm [24], Fountain code [64], Yin-Yang code [65] and DNA-AEon [66].”
Liu, Q., Liu, Q., Zhang, J., Zhang, C., Qian, L., Qi, H., Li, Y., & Song, D. (2025) · Science Advances · doi:10.1126/sciadv.adw2613 · Cited by 21
König, N. F., Ouahabi, A. A., Poyer, S., Charles, L., & Lutz, J. (2017) · Angewandte Chemie · doi:10.1002/ange.201702384 · Cited by 19
Multidimensional data organization and random access in large-scale DNA storage systems
Song, X., Shah, S., & Reif, J. H. (2021) · Theoretical Computer Science · doi:10.1016/j.tcs.2021.09.021 · Cited by 19
Das, S., Chen, A., & Marinella, M. J. (2021) · doi:10.1109/irds54852.2021.00011 · Cited by 31
DNA storage—from natural biology to synthetic biology
Bencúrová, E., Akash, A., Dobson, R. C. J., & Dandekar, T. (2023) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2023.01.045 · Cited by 25
“Despite the recent advances in synthetic biology, for example the appearance of the “DNA fountain” [24] and the “DNA harddrive” [15] as devices, there are major obstacles that prevent the application of DNA data storage for routine use.”
Evolutionary approach to construct robust codes for DNA-based data storage
Rasool, A., Jiang, Q., Wang, Y., Huang, X., Qu, Q., & Dai, J. (2023) · Frontiers in Genetics · doi:10.3389/fgene.2023.1158337 · Cited by 22
“The natural objective of DNA-encoding methods is to provide high-density, error-free, and stable DNA codes by dynamic programming (Yim et al., 2014; Erlich and Zielinski, 2017; Organick et al., 2018; Lu et al., 2023).”
BackgroundAssembly of Reusable DNA Blocks for Data Storage Using the Principle of Movable Type Printing
Xu, C., Ma, B., Dong, X., Lei, L., Hao, Q., Zhao, C., & Liu, H. (2023) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.3c01860 · Cited by 19
Bar-Lev, D., Marcovich, S., Yaakobi, E., & Yehezkeally, Y. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3292895 · Cited by 30
Processing DNA Storage through Programmable Assembly in a Droplet‐Based Fluidics System
Yu, M., Lim, D., Kim, J.-W., & Song, Y. (2023) · Advanced Science · doi:10.1002/advs.202303197 · Cited by 18
Storage‐D: A user‐friendly platform that enables practical and personalized DNA data storage
Huang, X., Cui, J., Qiang, W., Ye, J., Wang, Y., Xie, X., Li, Y., & Dai, J. (2024) · iMeta · doi:10.1002/imt2.168 · Cited by 23
“…binary codec algorithms, the “ Wukong ” algorithm currently has the highest coding potential of 1.98 bits/nt, which is the same as the “ DNA Fountain ” algorithm proposed by Erlich and Zielinski [13] and slightly higher than the “ Yin – Yang ” algorithm proposed by Ping et al. [19] (Table 1).”
BackgroundMethodResultInfluentialMultiplexed Random Access Approach to DNA Microspheres for High‐Capacity Data Storage
Zhong, W., Wang, S., Geng, C., Zheng, Y., Bai, S., Cao, X., Liu, K., Yang, Y., Lü, C., & Jiang, X. (2024) · Advanced Functional Materials · doi:10.1002/adfm.202408852 · Cited by 18
Krzanowski, R. (2020) · Philosophies · doi:10.3390/philosophies5020010 · Cited by 21
Rapid, robust plasmid verification by de novo assembly of short sequencing reads
Gallegos, J. E., Rogers, M. F., Cialek, C. A., & Peccoud, J. (2020) · Nucleic Acids Research · doi:10.1093/nar/gkaa727 · Cited by 22
“There is increasing interest in using DNA as a medium for information storage (58, 59).”
BackgroundReconstruction Algorithms for DNA-Storage SystemsPreprint
Sabary, O., Yucovich, A., Shapira, G., & Yaakobi, E. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.09.16.300186 · Cited by 18
Sequential DNA Coding for Programmable Information Encryption
Fu, W., Zhao, Y., Cao, J., Zhao, X., Chen, F., Fan, C., & Zhao, Y. (2025) · Advanced Materials · doi:10.1002/adma.202418688 · Cited by 18
Combating the Counterfeit: A Review on Hardware-Based Anticounterfeiting Technologies
Choudhury, S., Costa, F., Manara, G., & Genovesi, S. (2025) · Applied Sciences · doi:10.3390/app151810298 · Cited by 21
“CDs offer promising contributions to product security, environmental sustainability, and the circular economy [128].”
Magnetized solvents: Characteristics and various applications
Absalan, Y., Gholizadeh, M., & Choi, H. J. (2021) · Journal of Molecular Liquids · doi:10.1016/j.molliq.2021.116167 · Cited by 16
Limited-Magnitude Error Correction for Probability Vectors in DNA Storage
Zhang, W., Chen, Z., & Wang, Z. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838471 · Cited by 23
“Reading the stored information requires sequencing of the DNA and decoding to obtain the original digital information [1]–[7].”
DNA-QLC: an efficient and reliable image encoding scheme for DNA storage
Zheng, Y., Cao, B., Zhang, X., Cui, S., Wang, B., & Zhang, Q. (2024) · BMC Genomics · doi:10.1186/s12864-024-10178-5 · Cited by 30
“Subsequent research introduced alternative encoding methods, such as DNA Fountain [5] and the Yin-Yang codec system [6], which explored new solutions without compromising information density.”
BackgroundMethodBead‐Based DNA Synthesis and Sequencing for Integrated Data Storage Using Digital Microfluidics
Piao, Y., Fang, Y., Li, B., Man, T., Chen, J., Zhu, F., Wang, W., Wan, Y., & Deng, S. (2024) · Angewandte Chemie International Edition · doi:10.1002/anie.202416004 · Cited by 18
DNA event recorders send past information of cells to the time of observation
Ishiguro, S., Mori, H., & Yachie, N. (2019) · Current Opinion in Chemical Biology · doi:10.1016/j.cbpa.2019.05.009 · Cited by 19
A high storage density strategy for digital information based on synthetic DNA
Zhang, S., Huang, B., Song, X., Zhang, T., Wang, H., & Liu, Y. (2019) · 3 Biotech · doi:10.1007/s13205-019-1868-4 · Cited by 17
Molecular data storage with zero synthetic effort and simple read-out
Bohn, P., Weisel, M. P., Wolfs, J., & Meier, M. A. R. (2022) · Scientific Reports · doi:10.1038/s41598-022-18108-9 · Cited by 20
Xeno Nucleic Acids as Functional Materials: From Biophysical Properties to Application
Bian, T., Pei, Y., Gao, S., Zhou, S., Sun, X., Dong, M., & Song, J. (2024) · Advanced Healthcare Materials · doi:10.1002/adhm.202401207 · Cited by 17
Batch Optimization for DNA Synthesis
Makarychev, K., Rácz, M. Z., Rashtchian, C., & Yekhanin, S. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3184903 · Cited by 19
“Batch Optimization for DNA Synthesis Konstantin Makarychev, Miklós Z. Rácz , Cyrus Rashtchian , and Sergey Yekhanin Abstract —Large pools of synthetic DNA molecules have been recently used to reliably store significant volumes of digital data.”
BackgroundJiang, S., & Luo, J. (2022) · Journal of Engineering Design · doi:10.1080/09544828.2022.2143155 · Cited by 20
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric
Bar-Lev, D., Etzion, T., & Yaakobi, E. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3227128 · Cited by 24
Geng, C., Liu, S., & Jiang, X. (2023) · Chemical Science · doi:10.1039/d2sc06466a · Cited by 16
Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage Systems
Bar-Lev, D., Sabary, O., Gabrys, R., & Yaakobi, E. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206882 · Cited by 18
“One of the main components in any DNA storage system [1], [8], [17], [23] is a DNA sequencer, which reads back the user’s pre-stored information.”
InfluentialProgrammable Primer Switching for Regulating Enzymatic DNA Circuits
Zhang, Y., Chen, Y., Liu, X., Ling, Q., Wu, R., Yang, J., & Zhang, C. (2024) · ACS Nano · doi:10.1021/acsnano.3c12000 · Cited by 16
Covering All Bases: The Next Inning in DNA Sequencing Efficiency
Abraham, H., Gabrys, R., & Yaakobi, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619092 · Cited by 29
“The DNA storage process involves synthesis , creating artificial DNA strands encoding user information with limitations leading to short strands and multiple noisy copies [2], storage by a storage container and sequencing , a key component [3], [4], [5], [6], translates DNA into digital sequences.”
BackgroundMethodStereochemical conversion of nucleic acid circuits via strand displacement
Hsieh, W., Rama, G., Wang, A. R., Wu, S. F., Chamdia, R., & Ly, D. H. (2018) · Communications Chemistry · doi:10.1038/s42004-018-0089-9 · Cited by 16
Pan, C., Yazdi, S. M. H. T., Tabatabaei, S. K., Hernandez, A. G., Schroeder, C. M., & Milenković, O. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054262 · Cited by 21
“fashion for thousands of years [1, 2, 3, 4, 5, 6, 7, 8, 9].”
Gabrys, R., Kiah, H. M., Vardy, A., Yaakobi, E., & Zhang, Y. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9173933 · Cited by 19
“Another approach to dealing with media degradation is to generate strands of DNA that have approximately balanced GC-content1, and this approach has been leveraged in several existing works such as [5], [17], [18].”
MethodError Rate-Based Log-Likelihood Ratio Processing for Low-Density Parity-Check Codes in DNA Storage
Lu, X., Jeong, J., Kim, J.-W., No, J., Park, H., No, A., & Kim, S. (2020) · IEEE Access · doi:10.1109/access.2020.3021700 · Cited by 19
“To address this issue, simple error-correction channel codes [7] such as Reed-Solomon (RS) codes [6], Bose–Chaudhuri–Hocquenghem (BCH) codes [4], and fountain codes [8], have been considered for DNA storage system.”
BackgroundMethodImage storage onto synthetic DNA
Dimopoulou, M., Antonini, M., Barbry, P., & Appuswamy, R. (2021) · Signal Processing Image Communication · doi:10.1016/j.image.2021.116331 · Cited by 18
“Finally, Erlich et al [8] have implemented an encoding using Fountain codes to reach a high coding potential.”
BackgroundMethodInfluentialFeedback Strategies for Online Fountain Codes With Limited Feedback
Cai, P., Zhang, Y., Wu, Y., Chang, X., & Pan, C. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2020.2997683 · Cited by 16
“A LTHOUGH they are classified as rateless codes [1], fountain codes have been commonly applied in various fields [2], including broadcasting [3], data storage [4], and video streaming [5].”
BackgroundA Robust and Efficient Representation‐based DNA Storage Architecture by Deep Learning
Su, Y., Chu, L., Lin, W., Yao, X., Xu, P., & Liu, W. (2024) · Small Methods · doi:10.1002/smtd.202400959 · Cited by 16
Error Probability Bounds for Coded-Index DNA Storage Systems
Weinberger, N. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3176917 · Cited by 20
“The scheme follows a practical approach to this channel [4]–[6], [10] in which the lack of order of the molecules is resolved by an index.”
BackgroundDigital Polymers Based on Cyclic Monomers
Ren, X., Ding, H., Li, S., & Zhang, K. (2024) · Macromolecules · doi:10.1021/acs.macromol.3c02405 · Cited by 15
DNA microarray chips: Fabrication and cutting-edge applications
Xu, J., Chun, H., Wang, L., Mei, H., Chen, S., & Huang, X. (2024) · Chemical Engineering Journal · doi:10.1016/j.cej.2024.155937 · Cited by 23
Gimpel, A. L., Stark, W. J., Heckel, R., & Grass, R. N. (2024) · Digital Discovery · doi:10.1039/d4dd00220b · Cited by 20
Securing the Exchange of Synthetic Genetic Constructs Using Digital Signatures
Gallegos, J. E., Kar, D. M., Ray, I., Ray, I., & Peccoud, J. (2020) · ACS Synthetic Biology · doi:10.1021/acssynbio.0c00401 · Cited by 15
Szweda, R., Tschopp, M., Félix, O., Decher, G., & Lutz, J. (2018) · Angewandte Chemie · doi:10.1002/ange.201810559 · Cited by 15
Robust Indexing - Optimal Codes for DNA Storage
Sima, J., Raviv, N., & Bruck, J. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174447 · Cited by 18
“Prototype implementations of DNA storage stored 643KB data in [3] and 739KB data in [6] respectively, which were later improved in [4] and [20].”
MethodDeep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep LearningPreprint
Bar-Lev, D., Orr, I., Sabary, O., Etzion, T., & Yaakobi, E. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.00031 · Cited by 15
“Clustering Erlich et al.(6) Grass et al.”
BackgroundInfluentialHD-Code: End-to-End High Density Code for DNA Storage
Wu, J., Zhang, S., Zhang, T., & Liu, Y. (2021) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2021.3102122 · Cited by 19
“A DNA storage scheme for DNA fountain code has been proposed [9].”
Method
Metadata
- Authors
- Erlich, Y., & Zielinski, D.
- Affiliations
- New York Genome Center (US)
- Corresponding author
- Erlich, Yaniv
- Venue
- Science
- Published
- 2017-03-03
- Volume
- 355
- Issue
- 6328
- Pages
- 950-954
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2592122940
- Cited by
- 898
- References
- 37
- Citations by year
- 2026: 90 · 2025: 135 · 2024: 124 · 2023: 115 · 2022: 94 · 2021: 94 · 2020: 93 · 2019: 72 · 2018: 54 · 2017: 26
- FWCI
- 27.23
- Type
- journal article
- Language
- en
- Open access
- green
- doi.org
- Licence
- cc-by-nc
- Locations
- Science (publishedVersion)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc)
- PubMed (publishedVersion)
- Funders
- Burroughs Wellcome Fund
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
- Keywords
- DNA data storage, DNA encoding, PCR
- MeSH terms
- Algorithms, Base Sequence, DNA, Oligonucleotides, Information Storage and Retrieval, Libraries, Digital, High-Throughput Nucleotide Sequencing
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.