Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Abstract
Information, such as text printed on paper or images projected onto microfilm, can survive for over 500 years. However, the storage of digital information for time frames exceeding 50 years is challenging. Here we show that digital information can be stored on DNA and recovered without errors for considerably longer time frames. To allow for the perfect recovery of the information, we encapsulate the DNA in an inorganic matrix, and employ error‐correcting codes to correct storage‐related errors. Specifically, we translated 83 kB of information to 4991 DNA segments, each 158 nucleotides long, which were encapsulated in silica. Accelerated aging experiments were performed to measure DNA decay kinetics, which show that data can be archived on DNA for millennia under a wide range of conditions. The original information could be recovered error free, even after treating the DNA in silica at 70 °C for one week. This is thermally equivalent to storing information on DNA in central Europe for 2000 years.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“However, the sequencing coverage (number of read counts of a unique sequence) of an oligonucleotide (henceforth referred to simply as “oligo”) was found to be very uneven, requiring modern error correction codes capable of handling sequence dropout7–12.”
From Quantifying Molecular Bias in DNA Data Storage (2019) · cites this paper as [7]
In the citing paper
“Moreover, their durability reaches a maximum of 50 years in perfectly optimal conditions [4].”
From DNA Data Storage. (2023) · cites this paper as [4]
In the citing paper
“In 2015, by storing data-encoding DNA strands in silica beads, Grass et al. (2015) achieved reliable data storage in DNA, which was estimated be stable for more than 2000 years.”
From Large-Scale de Novo Oligonucleotide Synthesis for Whole-Genome Synthesis and Data Storage: Challenges and Opportunities (2021) · cites this paper as Grass et al., 2015
In the citing paper
“these molecules are stable for thousands of years under suitable storage conditions;4”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [4]
In the citing paper
“In 2015, a DNA data storage that used an error-correcting scheme, which enabled the recovery of full data, was realized by Grass et al.4”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [4]
12 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Instability and decay of the primary structure of DNA
Lindahl, T. (1993) · Nature · doi:10.1038/362709a0 · Cited by 5,679
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
The World’s Technological Capacity to Store, Communicate, and Compute Information
Hilbert, M., & López, P. (2011) · Science · doi:10.1126/science.1200970 · Cited by 1,643
Rate of depurination of native deoxyribonucleic acid
Lindahl, T., & Nyberg, B. (1972) · Biochemistry · doi:10.1021/bi00769a018 · Cited by 1,556
Dabney, J., Knapp, M., Glocke, I., Gansauge, M.-T., Weihmann, A., Nickel, B., Valdiosera, C., García, N., Pääbo, S., Arsuaga, J.-L., et al. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1314445110 · Cited by 1,443
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
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
Large-scale de novo DNA synthesis: technologies and applications
Kosuri, S., & Church, G. M. (2014) · Nature Methods · doi:10.1038/nmeth.2918 · Cited by 869
The half-life of DNA in bone: measuring decay kinetics in 158 dated fossils
Allentoft, M. E., Collins, M., Harker, D., Haile, J., Oskam, C. L., Hale, M. L., Campos, P. F., Samaniego, J. A., Gilbert, M. T. P., Willerslev, E., et al. (2012) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2012.1745 · Cited by 633
A mitochondrial genome sequence of a hominin from Sima de los Huesos
Meyer, M., Fu, Q., Aximu-Petri, A., Glocke, I., Nickel, B., Arsuaga, J.-L., Martínez, I., Gracia, A., de Castro, J. M. B., Carbonell, E., et al. (2014) · Nature · doi:10.1038/nature12788 · Cited by 534
Research works printed but not linked: 2
- Shah S., 2004, Annu. Reliab. Maintainability Symp. Proc., 163
- Wan E., 2010, Curr. Issues Mol. Biol., 12, 135
Cited by
Items 501–600 of 772
Tian, K., Zhang, S., Chen, S., Chingarande, G. R., Hou, C., Ma, E., Ren, J., Ding, S., Stertzer, M., Luan, B., et al. (2025) · PNAS Nexus · doi:10.1093/pnasnexus/pgaf233 · Cited by 3
“Current DNA data storage approaches write information through direct synthesis of DNA fragments (19, 21 – 25, 28 –”
Marker Guess & Check Plus (MGC+): An Efficient Short Blocklength Code for Random Edit Errors
Khabbaz, R., Antonini, M., & Hanna, S. K. (2025) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc65386.2025.11154528 · Cited by 3
“In this context, random edit errors—deletions, insertions, and substitutions of nucleotides—occur during synthesis, storage, and sequencing [3].”
DBSP: An End-to-End Pipeline for DNA Storage Data Reconstruction From DNA Sequencing
Cao, B., Zhao, Y., Xie, L., Shao, Q., Wang, K., Wang, B., Zhou, S., & Zheng, P. (2025) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2025.3613268 · Cited by 6
“Internal coding resolves errors in individual DNA sequences, and external coding resolves the loss of an entire DNA sequence [27].”
On the Reliability of Information Retrieval from MDS Coded Data in DNA Storage
Hanna, S. K. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195362 · Cited by 3
“Maximum distance separable (MDS) codes, such as Reed-Solomon codes [20], are a common choice in practice for both inner and outer codes due to their optimal error-correction properties [3], [11], [13].”
From deep archival to real-time applications: Challenges and opportunities in DNA data storage
Liu, Q., Liu, Q.-J., Kang, S., Li, J., Xia, H., & Qi, H. (2026) · Biotechnology Advances · doi:10.1016/j.biotechadv.2026.108833 · Cited by 3
Zhang, J., Chen, L., Sun, J., Li, S., Zhou, Y., Wu, Z., Li, C., Zheng, Z., & Luo, R. (2026) · Nature Communications · doi:10.1038/s41467-026-71485-x · Cited by 4
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
Capacity of the Shotgun Sequencing Channel
Ravi, A. N., Vahid, A., & Shomorony, I. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834409 · Cited by 3
On the List Size in the Levenshtein’s Sequence Reconstruction Problem
Junnila, V., Laihonen, T. K., & Lehtilä, T. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834612 · Cited by 3
DNA Origami Steganography Based on Photocleavable Oligonucleotides
Liu, M., Hou, X., Sun, Y., & Liu, H. (2024) · ChemPhotoChem · doi:10.1002/cptc.202400132 · Cited by 3
A New Algebraic Approach for String Reconstruction From Substring Compositions
Gupta, U., & Mahdavifar, H. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3493762 · Cited by 3
Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
Junnila, V., Laihonen, T. K., & Lehtilä, T. (2025) · Theoretical Computer Science · doi:10.1016/j.tcs.2025.115279 · Cited by 3
“As the proof is quite similar to the proof of Theorem 14, we postpone the proof to Appendix.”
Capacity of Frequency-Based Channels: Encoding Information in Molecular Concentrations
Gerzon, Y., Shomorony, I., & Weinberger, N. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3578504 · Cited by 8
“As a prominent example, in DNA storage systems [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], information is encoded to K molecules, each of which is a strand of length L composed from the four possible nucleotides, denoted by A : = { A , C , G , T } .”
Input Optimization in the Composite DNA Storage Channel
Kobovich, A., & Weinberger, N. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3595005 · Cited by 7
LOCO Codes Can Correct as Well: Error-Correction Constrained Coding for DNA Data Storage
İrimağzı, C., & Hareedy, A. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3616642 · Cited by 3
The Potential of Plants and Seeds in DNA-Based Information Storage
Ljubič, K., Fister, I., & Murovec, J. (2017) · Advanced information and knowledge processing · doi:10.1007/978-3-319-59090-5_4 · Cited by 3
DNA Compression using an innovative Index based Coding Algorithm
Zahra, S. E., Masood, K., & Asif, M. (2019) · International Multi-Topic Conference · doi:10.1109/inmic48123.2019.9022799 · Cited by 3
“The size of worldwide DNA arrangement Databases surpassed 100 Gig humbles in 2005, the bend demonstrates an exponential development of Gen-Bank [10] database as shown in Fig.”
Storing Digital Data Into DNA: A Comparative Study Of Quaternary Code Construction
Dimopoulou, M., Antonini, M., Barbry, P., & Appuswamy, R. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054654 · Cited by 3
“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.”
MethodMRC: A High Density Encoding Method for Pratical DNA-based Storage
Liu, Q., Wang, P., Cui, J., & Qi, H. (2020) · International Conference on Advanced Cloud and Big Data · doi:10.1109/cbd51900.2020.00012 · Cited by 4
“Several mechanisms [9] such as RS (Reed-Solomon) codes [8], fountain codes [6] have been adopted.”
BackgroundMethodInfluentialHow to Enable Index Scheme for Reducing the Writing Cost of DNA Storage on Insertion and Deletion
Lin, Y., Liang, Y.-P., Chen, T., Chang, Y.-H., Chen, S.-H., Wei, H., & Shih, W. (2022) · ACM Transactions on Embedded Computing Systems · doi:10.1145/3516482 · Cited by 4
“For tackling this problem, Choi et al. [1, 2, 9, 14] presented a data encoding scheme to minimize the overhead resulted from redundant bits for data correction.”
BackgroundMethodOn the decoding error weight of one or two deletion channels
Sabary, O., Bar-Lev, D., Gershon, Y., Yucovich, A., & Yaakobi, E. (2026) · Designs Codes and Cryptography · doi:10.1007/s10623-026-01873-3 · Cited by 3
“One of the dominant motivating applications of the sequence reconstruction problems is DNA storage [2], [5], [19], [33], [64], [90], where every DNA strand has several noisy copies.”
Cipher constrained encoding for constraint optimization in extended nucleic acid memory
Biswas, S., Dey, S., Nath, P., & Nath, S. (2022) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2022.107696 · Cited by 3
Towards long double-stranded chains and robust DNA-based data storage using the random code system
Yang, X., Shi, X., Lai, L., Chen, C., Xu, H., & Deng, M. X. (2023) · Frontiers in Genetics · doi:10.3389/fgene.2023.1179867 · Cited by 3
Towards Migration-Free "Just-in-Case" Data Archival for Future Cloud Data Lakes Using Synthetic DNA
Marinelli, E., Yan, Y., Magnone, V., Dumargne, C., Barbry, P., Heinis, T., & Appuswamy, R. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3594512.3594522 · Cited by 3
“Several researchers have proposed encoding solutions to demonstrate the feasibility of using DNA as a digital storage medium [4, 7, 9, 11, 15, 18, 19, 23, 28].”
BackgroundSais, M., Rafalia, N., & Abouchabaka, J. (2023) · E3S Web of Conferences · doi:10.1051/e3sconf/202341201090 · Cited by 4
“In a study conducted by researchers in[17] various experiments were performed to evaluate the artificial aging of DNA.”
BackgroundDirect Transposition Interleaving Technique for DNA Data Storage
Li, Z., Bi, K., & Zhao, X. (2023) · International Conference on Biomedical Engineering and Applications (ICBEA) · doi:10.1109/icbea58866.2023.00018 · Cited by 3
“Significant efforts have been directed towards improving the reliability of DNA-based data storage [13-18].”
BackgroundMethodKilinc, V., Hayakawa, R., Yamauchi, Y., Wakayama, Y., & Hill, J. P. (2024) · Advanced Sensor Research · doi:10.1002/adsr.202300176 · Cited by 3
A Practical Concatenated Coding Scheme for Noisy Shuffling Channels with Coset-based Indexing
Haghighat, J., & Duman, T. M. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437131 · Cited by 3
Levenshtein Distance Embedding with Poisson Regression for DNA Storage
Wei, X., Guo, A. J. X., Sun, S., Wei, M., & Yu, W. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i14.29509 · Cited by 4
“In recent years, the rapid development of DNA storage (Goldman et al. 2013; Church, Gao, and Kosuri 2012; Grass et al. 2015) has introduced numerous applications of the Levenshtein distance, including sequence clustering (Rashtchian et al. 2017; Zorita, Cusc ´ o, and Filion 2015; Qu, Yan, and Wu…”
BackgroundDNA Image Storage Using a Scheme Based on Fuzzy Matching on Natural Genome
Zhang, J., Chen, S., Zhang, H., Shen, Y., & Ping, Z. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-91415-8_48 · Cited by 3
Using DNA For Data Storage: Encoding and Decoding Algorithm Development
Suyehira, K. (2018) · ScholarWorks (Boise State University) · doi:10.18122/td/1500/boisestate · Cited by 3
“In the development of their algorithm, Goldman and his team were looking to achieve an improvement upon the ideas presented by Grass, et. al..”
BackgroundMethodInfluentialThe Impact of Big Data and Knowledge Management on R&D Projects from Automotive Industry
Palade, H. C., Nicolaescu, S. Ş., & Kifor, C. V. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25159-2_17 · Cited by 2
On the number of DNA sequence profiles for practical values of read lengths
Chang, Z., Chrisnata, J., Ezerman, M. F., & Kiah, H. M. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541780 · Cited by 2
“To further protect against errors, Grass et al. later incorporated Reed-Solomon error-correction schemes and encapsulated the DNA media in silica [3].”
BackgroundOn the Reliability of Information Retrieval From MDS Coded Data in DNA Storage
Hanna, S. K. (2026) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2026.3690724 · Cited by 2
“DNA-based data storage has emerged as a promising alternative due to its exceptional stability and ultra-high storage density [3], [4], [5].”
Optimization of Highly Robust DNA Storage Schemes Based on Specific Base Sequences
Zhang, X., Qi, B., & Niu, Y. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3553616 · Cited by 2
“Grass et al. [7] associated finite domains with base triplets and proposed coding algorithms that can avoid single-base repeats longer than 3.”
Conditional Entropies of k-Deletion/Insertion Channels
Singhvi, S., Sabary, O., Bar-Lev, D., & Yaakobi, E. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3581849 · Cited by 2
“I N THE last decade, channels that introduce insertion and deletion errors have attracted significant attention due to their relevance to DNA storage systems [3], [35], [52], [53], [75], [79], where deletions and insertions are among the most dominant errors [40], [61].”
Efficient Nested Hash Reassembly Codes for Torn Paper Channels
Jiao, X., Jiao, B., Mu, J., & Han, H. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3582709 · Cited by 2
“Since then, several DNA-based storage prototypes have been presented to demonstrate the viability of DNA as a medium for high-density archival data storage [6], [7], [8], [9], [10], [11], [12].”
Efficient Data Storage in DNA Sequences Aided by p-gram Huffman Coding
Tu, K., & Puchała, D. (2025) · IEEE Access · doi:10.1109/access.2025.3589079 · Cited by 2
“It should be noted that the coding efficiency of the methods in [10], [11], [12], [13], [14], and [15] is independent of the type of data, as they do not involve compression.”
Renewable Electrode Array Based on Transformable Metal for Scaling up DNA Synthesis and Manipulation
Feng, D., Ma, B., Xu, C., Xu, J., Zhang, Y., Chen, Y., Chen, G., Gao, Y., Chen, D., Yu, W., et al. (2025) · Advanced Functional Materials · doi:10.1002/adfm.202513703 · Cited by 4
TransDNA: A Deep Transfer Learning Network for Sequence Reconstruction in DNA-Based Data Storage
Qin, Y., Zhu, F., Xi, B., & Duan, Y. (2025) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbbio.2025.3602912 · Cited by 2
Leal, A. G., Aoyagi, T. Y., Costa-Martins, A. G., de Souza, D. T., da Silva, C. M. F., Ueda, E. T., Parada, M. G. D. O., Feitosa, A. E., & Fujita, A. (2025) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2025.09.002 · Cited by 2
Channels With Input-Correlated Synchronization Errors
Con, R., & Ribeiro, J. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3694251 · Cited by 2
“More broadly, a long series of works has explored, among many other things, the types of errors and error rates that occur in such systems, using di ff erent synthesis and sequencing technologies [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16].”
High‐Fidelity Data Retrieval from Synthetic DNA Pools via Machine Learning Model
Liu, Q., Zhang, J., Cui, J., Lu, J., Li, J., Liu, Z., & Qi, H. (2026) · Small · doi:10.1002/smll.202509522 · Cited by 2
DNA Data Storage Architecture via Ligation of Dynamic DNA Bytes
Jia, L., Shi, Y., Yang, J., Li, S., Yang, W., Li, W., Zhang, M., Li, Q., Zhang, Y., Wang, X., et al. (2026) · Small Methods · doi:10.1002/smtd.202502001 · Cited by 2
“The first and most established approach relies on de novo synthesis of data-encoding strands using high-density encoding strategies [ 12–14 ].”
Zhang, Y., Qin, R., Ge, Q., Guo, Q., & Chen, W. (2026) · Science Advances · doi:10.1126/sciadv.aec1469 · Cited by 4
“DNA data storage encodes and distributes information across numerous DNA strands ( 4 – 6 ).”
Grass, R. N., & Stark, W. J. (2015) · AIChE Journal · doi:10.1002/aic.15103 · Cited by 2
Self-citationNext Generation Information Storage Technology: DNA Data Storage
Liu, S., Ye, Z., & Chen, M. (2020) · International Conference on Machine Learning and Computing (ICMLC) · doi:10.1145/3383972.3383999 · Cited by 2
The Input and Output Entropies of the k-Deletion/Insertion Channel with Small Radii
Singhvi, S., Sabary, O., Bar-Lev, D., & Yaakobi, E. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965878 · Cited by 2
“INTRODUCTION In the last decade, channels that introduce insertion and deletion errors attracted significant attention due to their relevance to DNA storage systems [3], [19], [33], [34], [45], [49], where deletions and insertions are among the most dominant errors [23], [38].”
BackgroundDNA-Storage in Future Communication Networks
Hofmann, P., Cabrera, J. A., Krieg, E., Bassoli, R., & Fitzek, F. H. P. (2023) · IEEE Communications Magazine · doi:10.1109/mcom.011.2200755 · Cited by 2
“In fact, proactive network enable new future of anticipatory ’neg-ative’ preservation 4]. price be paid and processing [ data prediction for instance by MIT-spinoff CATALOG and San Fran-cisco-based dnA w rItIng e ngIneerIng Writing data into DNA involves the synthesis of 1.”
BackgroundMethodAdaptable 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
“With DNA serving as the storage medium, data longevity potentially extends to thousands of years [4], far surpassing the lifespan of conventional storage devices like hard drives, while simultaneously cutting costs.”
BackgroundFCBC Hybrid Encoding Method Based on Fountain Code and Base64 Code
Monash, Y. W., Bia, K., & Zhaob, X. (2023) · International Conference on Electronic Information Engineering and Computer Communication (EIECC) · doi:10.1109/eiecc60864.2023.10456627 · Cited by 2
“And the FCBC hybrid coding method also uses RS error correction codes [21-22], which can ensure that there are no errors such as base addition, replacement, and loss, and ensure coding accuracy.”
MethodVL-DNA: Enhancing DNA Storage Capacity with Variable Payload/Strand Lengths
Wei, Y., Dong, H., Wang, W., Li, B., & Du, D. H.-C. (2026) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3834768 · Cited by 3
“We then implemented three state-of-the-art encoding schemes: Rotation code [4][27], Blawat code [3], and Grass code [10], to encode the data respectively.”
Repurposing Waste Chemicals for Sustainable and Durable Molecular Data Storage
gumus, S., Biechele-Speziale, D., Manz, K. E., Pennell, K. D., Rubenstein, B. M., & Rosenstein, J. K. (2024) · ACS Omega · doi:10.1021/acsomega.3c09234 · Cited by 2
‘Do-it-yourself’ data storage on DNA paves way to simple archiving system
Imburgia, C. E., & Nivala, J. (2024) · Nature · doi:10.1038/d41586-024-03312-6 · Cited by 2
Sequence analysis and decoding with extra low-quality reads for DNA data storage
Park, J., Jeon, H. H., Lee, J. W., & Park, H. (2025) · Bioinformatics · doi:10.1093/bioinformatics/btaf335 · Cited by 2
Optimally Decoding 2-D Reed–Solomon Codes Against Deletion Errors
Singhvi, S. (2026) · IEEE Transactions on Information Theory · doi:10.1109/tit.2026.3656004 · Cited by 2
“I N THE last decade, channels that introduce insertion and deletion errors have attracted significant attention due to their relevance to DNA storage systems [3], [28], [52], [53], [69], [78], where deletions and insertions are among the most dominant error types [36], [56].”
Artificial Systems Can Complement Human Vision in Medical Imaging
Gentillon, H. (2016) · International Journal of Sciences: Basic and Applied Research · Cited by 2
Classical and Quantum Error-Correction Coding in Genetics
Djordjević, I. B. (2015) · Springer eBooks · doi:10.1007/978-3-319-22816-7_6 · Cited by 2
Post CMOS Computing Beyond Si: DNA Computer as Future Alternative
Sarkar, M., & Ghosal, P. (2016) · IEEE International Symposium on Nanoelectronic and Information Systems (iNIS) · doi:10.1109/inis.2016.039 · Cited by 2
“It also has attracted many researchers for being a primary application of DNA molecules as long term and reliable data storage [3] [5] [6].”
BackgroundInfo-Convergence Ceramic Nanosystems
Jin, W., & Park, D.-H. (2019) · Journal of the Korean Ceramic Society · doi:10.4191/kcers.2019.56.5.01 · Cited by 2
Hiding and Storing Messages and Data in DNA
Demidov, V. V. (2020) · Springer eBooks · doi:10.1007/978-3-030-36434-2_2 · Cited by 3
Selective Run-Length Constrained Encoding Scheme on Extended Nucleic Acid Memory
Biswas, S., Ghosh, T., & Nath, S. (2022) · IEEE VLSI Device Circuit and System (VLSI DCS) · doi:10.1109/vlsidcs53788.2022.9811440 · Cited by 2
“This further led to the development of error correction methods [4].”
MethodInsertion and Deletion Correction in Polymer-based Data Storage
Banerjee, A., Wachter-Zeh, A., & Yaakobi, E. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834352 · Cited by 2
Fei, Z., Li, M., Cheng, C., Tan, G., & Xiao, P. (2022) · Nano Select · doi:10.1002/nano.202200168 · Cited by 2
RetractedConstrained Code for Data Storage in DNA via Nanopore Sequencing
Whritenour, K., Civelek, M., & Farnoud, F. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10476969 · Cited by 2
“One such example is the application of Reed-Solomon codes [8] and Fountain Codes [9] for erasure errors.”
MethodBacSoft: A Tool to Archive Data on BacteriaPreprint
Agrawal, A., Limbachiya, D., Ravikumar, M., Saiyed, T., & Gupta, M. K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.01902 · Cited by 2
“In last few years, researchers have developed DNA based data storage systems by introducing different encoding schemes which showcased that such systems are robust [7], reliable [3] and dense [15].”
BackgroundYunfei, L., & Xuncai, Z. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.09.27.559852 · Cited by 3
“Church[15], Grass[16], Blawat[17], and Erlich[18] used a binary transcoding strategy (0 for A or G, 1 for C or T) to control the GC content to avoid long homopolymer sequences.”
MethodInfluentialFECDO-Flexible and Efficient Coding for DNA OdysseyPreprint
Sun, F., & Qian, L. (2024) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2024.02.18.580107 · Cited by 2
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
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 1
Embedding DNA-based natural language in microbes for the benefit of future researchers
Zhang, H., Huang, J., Wang, X., Gao, Z., Song, M., Li, H., Zhou, S., Wang, S., Wang, S., Yan, X., et al. (2024) · Digital Discovery · doi:10.1039/d4dd00251b · Cited by 1
Adaptive Arithmetic Coding-Based Encoding Method Toward High-Density DNA Storage
Hu, Y., Liu, Y., & Yang, Y. (2024) · Journal of Computational Biology · doi:10.1089/cmb.2024.0697 · Cited by 1
Headpiece-assisted DNA data storage in solution and solid
Hu, C., Wen, Q., Lai, Q., Xie, Z., Zhang, K., Zhou, L., & Qu, Z. (2024) · Chemical Communications · doi:10.1039/d4cc05109b · Cited by 1
Berton, C., Coatrieux, G., Gasnier, H., Haddad, S., Bellafqira, R., & Lavenier, D. D. (2025) · IEEE Access · doi:10.1109/access.2025.3560387 · Cited by 1
“There are | P mW | different sequences corresponding to the M prohibited motifs, so the probability that a sequence of m − 1 bases is in Note that the proposed solution as well as all experiments do not include an error-correction code, as solutions proposed in [21], [27], [29], and [42].”
Image Storage in DNA by an Extensible Quaternary Codec System
Pang, R., Dong, Y., & Zhao, X. (2025) · Applied Sciences · doi:10.3390/app15094760 · Cited by 1
Hardware-Accelerated Data Readout Platform Using Heterogeneous Computing for DNA Data Storage
Gou, X., Ge, Q., Guo, Q., Ren, M., Qi, T., Qin, R., & Chen, W. (2025) · Applied Sciences · doi:10.3390/app15095050 · Cited by 1
Silvano, C., Ferrandi, F., Curzel, S., Ielmini, D., Perri, S., Spagnolo, F., Corsonello, P., Schifano, S. F., Zambelli, C., Garofalo, A., et al. (2025) · Design, Automation, and Test in Europe · doi:10.23919/date64628.2025.10993254 · Cited by 1
Investigating enhanced stability in CTAB(C)-compacted DNA under aging conditions for data storage
Tandon, A., Nam, Y., Seo, S., & Park, S. H. (2025) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/addbb7 · Cited by 1
“The first-order decay kinetics were determined using the Arrhenius equation, enabling calculation of the half-life of DNA samples [30].”
InfluentialJiang, Y., Chen, L., Wang, J., Lin, H., & Gao, J. (2025) · Angewandte Chemie International Edition · doi:10.1002/anie.202506846 · Cited by 1
A method for fabricating CMOS back-end-of-line-compatible solid-state nanopore devices
Bouhamidi, M. Y., Dai, C., Stephan, M., Nag, J., Kinney, J. P., Wan, L., Waugh, M. J., Briggs, K., Katine, J. A., Tabard‐Cossa, V., et al. (2025) · Nanotechnology · doi:10.1088/1361-6528/ade5b7 · Cited by 2
“One such solution, molecular information storage (MIST), has emerged as a promising candidate, particularly for archival purposes, owing to its exceptional data density [2, 3], long-term stability [4], and remarkable energy efficiency [5].”
Ge, C., Dong, X. N., & Xue, Z. (2025) · Journal of Membrane Computing · doi:10.1007/s41965-025-00202-2 · Cited by 2
Advancements in DNA Tagging and Storage: Techniques, Applications, and Future Implications
Kuzdraliński, A., Miśkiewicz, M., Szczerba, H., Mazurczyk, W., Ociepa, T., Lechowski, M., & Ksi̜eżopolski, B. (2025) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.70040 · Cited by 1
“…overhead but low density (0.83 bits/base) requires more DNA material, increasing costs; (2) Error-correcting codes (e.g., Reed-Solomon [74], Fountain codes [77]): Essential for long-term stability but require redundancy that reduces effective density and complicates rapid field…”
InfluentialAchievable Rates of Frequency-based Channels of Unlimited Input Resolution
Tamir, R., & Weinberger, N. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195540 · Cited by 1
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
SCONE: A Practical, Constraint-Aware Plug-in for Latent Encoding in Learned DNA Storage
Ruan, C., Zhou, L., Han, R., Han, L., Zhao, B., Zhu, C., Jiang, W., Wang, W., & Ling, N. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562801 · Cited by 1
“DNA has matured from a storage medium into an intelligent computational substrate [1]–[4] DNA-based neural networks now demonstrate pattern classification through supervised learning [5] and sustained computation via heat-recharging [6], while bio-chips [7] enable system integration [8], [9].”
On Levenshtein’s Reconstruction Problem for Channels with Unique Insertion Error Patterns
Junnila, V., Laihonen, T. K., Lehtilä, T., & Devaraj, P. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240278 · Cited by 1
Seo, S., Tandon, A., Uyen, N. K., Le, Q. N., Lee, J., & Park, S. H. (2025) · Advanced Intelligent Discovery · doi:10.1002/aidi.202500166 · Cited by 1
Design and Analysis of Two-Layer Coding Scheme for DNA-Based Data Storage
Zhang, J., & Zhao, S. (2025) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2025.3648790 · Cited by 1
“D coding scheme) to encode messages is an e ffi cient way to combat both sequence-level errors and base-level errors in DNA-based data storage [17], [27], [28], [29], [30].”
InfluentialSensintaffar, 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
“DNA encoding and decoding convert binary data to DNA and vice versa [12], [16]–[20].”
On the Capacity of Noisy Frequency-based Channels
Gerzon, Y., Shomorony, I., & Weinberger, N. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653715 · Cited by 1
“DNA storage [1]–[3] presents a revolutionary approach to data archiving, and offers unparalleled data density and longevity, preserving data for millennia [4]–[7].”
Kang, T., Lim, D., Lee, W., Kim, J., Huang, X., Kim, J., & Song, Y. (2026) · ACS Nano · doi:10.1021/acsnano.5c13665 · Cited by 1
Chitosan hydrogels as dynamic media for information storage: Challenges and emerging applications
Zhang, J., Feng, S., Du, Y., & Shi, X. (2026) · International Journal of Biological Macromolecules · doi:10.1016/j.ijbiomac.2026.150526 · Cited by 1
Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors
Tegin, B., & Duman, T. M. (2026) · IEEE Transactions on Communications · doi:10.1109/tcomm.2026.3734335 · Cited by 1
“The practicality of DNA data storage was demonstrated in the early 2010s through large-scale proof-of-concept experiments [4], [5], showing that it offers a high-density solution with remarkable durability [6], [7].”
A Survey on the Coding for DNA Storage: Challenges, Algorithms, and Future Directions
Mu, L., Лиу, Л., Ding, L., & Zhu, Z. (2026) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2026.3677114 · Cited by 1
“DNA storage boasts a theoretical capacity of more than 200 petabytes per gram [5], long-term physical stability measurable in centuries or even millennia [6], and exceptional energy efficiency due to its non-volatility and ambient-temperature preservation requirements [7], [8].”
InfluentialLarge‐Scale Distribution of Physical Data Using DNA‐of‐Things Technology in Newspaper Printing
Granito, F., Gimpel, A. L., Stark, W. J., Heckel, R., & Grass, R. N. (2026) · Small · doi:10.1002/smll.202511931 · Cited by 1
Self-citationDirectly Encrypting DNA Sequences for Secure DNA Storage via Automata Cryptography
Kang, J., Sun, L., Liu, X., Yang, Z., Wang, B. G., Zhou, S., Cao, B., & Zheng, P. (2026) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2026.3695368 · Cited by 1
“Early DNA storage schemes [2], [3], [4] relied on specific mapping rules to accommodate biological constraints, convert bits into DNA sequences, and utilized error-correcting codes [3], [5] or sequence reconstruction algorithms [6], [7] to improve the ability to recover stored data.”
Robust 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
Landsman, D. (2026) · Springer eBooks · doi:10.1007/978-981-95-9450-4_16 · Cited by 1
Realistic Channel Model with Memory and Clustering for DNA Data Storage Using Nanopore Sequencing
Janvars, T., & Farkaš, P. (2026) · International Conference on Electrical, Computer and Energy Technologies (ICECET) · doi:10.1109/icecet65726.2026.11632588 · Cited by 1
“Two primary approaches exist for this identification: either using an explicit address field or index [1][3][5][21], or without explicit identification, grouping based solely on data correlations and similarities, as in [28][29].”
Baldansuren, A. (2016) · Applied Magnetic Resonance · doi:10.1007/s00723-016-0857-6 · Cited by 1
Metadata
- Authors
- Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J.
- Affiliations
- ETH Zurich (CH)
- Corresponding author
- Grass, Robert N.
- Venue
- Angewandte Chemie International Edition
- Publisher
- Wiley
- Published
- 2015-02-04
- Volume
- 54
- Issue
- 8
- Pages
- 2552-2555
- ISSN
- 1433-7851 (ISSN-L)
- 1521-3773
- OpenAlex
- W2114487425
- Semantic Scholar
- 67a2b9626157fecdef525c0d25bf7b051388a3a4
- Cited by
- 754
- References
- 26
- Citations by year
- 2026: 72 · 2025: 111 · 2024: 95 · 2023: 97 · 2022: 84 · 2021: 75 · 2020: 72 · 2019: 55 · 2018: 33 · 2017: 25 · 2016: 17 · 2015: 18
- FWCI
- 13.45
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Angewandte Chemie International Edition (publishedVersion)
- PubMed (publishedVersion)
- mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Nucleic Acid Chemistry
- Keywords
- DNA data storage, error-correcting codes, silica encapsulation, accelerated aging, digital preservation, thermal stability, information recovery
- MeSH terms
- Algorithms, DNA, Silicon Dioxide, Information Storage and Retrieval
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.