Data storage in DNA with fewer synthesis cycles using composite DNA letters.
Abstract
The density and long-term stability of DNA make it an appealing storage medium, particularly for long-term data archiving. Existing DNA storage technologies involve the synthesis and sequencing of multiple nominally identical molecules in parallel, resulting in information redundancy. We report the development of encoding and decoding methods that exploit this redundancy using composite DNA letters. A composite DNA letter is a representation of a position in a sequence that consists of a mixture of all four DNA nucleotides in a predetermined ratio. Our methods encode data using fewer synthesis cycles. We encode 6.4 MB into composite DNA, with distinguishable composition medians, using 20% fewer synthesis cycles per unit of data, as compared to previous reports. We also simulate encoding with larger composite alphabets, with distinguishable composition deciles, to show that 75% fewer synthesis cycles are potentially sufficient. We describe applicable error-correcting codes and inference methods, and investigate error patterns in the context of composite DNA letters.
Integrity signals
Registry
Cites
Statistics
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?
The coding efficiency of DNA data storage increased from 1 to 4.29 bits per base.
“The coding efficiency has increased from 1 to 4.29 bits per base (Anavy et al., 2019).”
From Large-Scale de Novo Oligonucleotide Synthesis for Whole-Genome Synthesis and Data Storage: Challenges and Opportunities (2021) · cites this paper as Anavy et al., 2019
A high coding efficiency of 4.29 bits per base was implemented using composite DNA letters.
“Anavy et al. (2019) implemented a high coding efficiency of 4.29 bits per base by using composite DNA letters.”
From Large-Scale de Novo Oligonucleotide Synthesis for Whole-Genome Synthesis and Data Storage: Challenges and Opportunities (2021) · cites this paper as Anavy et al., 2019
DNA has a theoretical data density of 6 bits for every 1 nm of polymer, or ∼4.5 × 10^7 GB/g, which is orders of magnitude higher than the densities achievable using traditional devices.
“On the basis of its physical dimensions, DNA has a theoretical data density of 6 bits for every 1 nm of polymer, or ∼4.5 × 107 GB/g,6 which is orders of magnitude higher than the densities achievable using traditional devices.7,8”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [7]
Physical and logical redundancy lower the storage density of DNA.
“While physical and logical redundancy lower the storage density of DNA, recent works have proposed to raise it by expanding the DNA alphabet using composite natural letters7,51,52 or chemically modified nucleotides.53”
From Emerging Approaches to DNA Data Storage: Challenges and Prospects (2022) · cites this paper as [7]
The citation lists haven’t been fetched yet
References 39 · Cited by 229
- Authors
- Anavy, L., Vaknin, I., Atar, O., Amit, R., & Yakhini, Z.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- Corresponding author
- Anavy, Leon
- Venue
- Nature Biotechnology
- Published
- 2019-09-09
- Volume
- 37
- Issue
- 10
- Pages
- 1229-1236
- ISSN
- 0733-222X (ISSN-L)
- 1087-0156
- 1546-1696
- OpenAlex
- W2972936807
- Cited by
- 229
- References
- 39
- Citations by year
- 2026: 33 · 2025: 46 · 2024: 42 · 2023: 35 · 2022: 26 · 2021: 22 · 2020: 23 · 2019: 2
- FWCI
- 6.01
- Type
- journal article
- Language
- en
- Update notices
- correction (2019-09-16)
- Open access
- closed
- Locations
- Nature Biotechnology (publishedVersion)
- PubMed (publishedVersion)
- Funders
- Israel Academy of Sciences and Humanities (Adams Fellowship)
- EC | Horizon 2020 Framework Programme (664918—MRG-Grammar)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
- Keywords
- DNA data storage, information redundancy, error-correcting codes, digital preservation, nucleotide composition, error patterns
- MeSH terms
- Algorithms, Base Sequence, DNA, Humans, Information Storage and Retrieval, Sequence Analysis, DNA, 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