Cited by 1,220DNA and Biological ComputingAdvanced biosensing and bioanalysis techniquesAlgorithms and Data Compression

Towards Practical, High-Capacity, Low-Maintenance Information Storage in Synthesized DNA

Open access
Goldman, Nick, Bertone, Paul, Chen, Siyuan, Dessimoz, Christophe, LeProust, Emily M., Sipos, Botond, Birney, Ewan·2013·Nature

Abstract

Digital production, transmission and storage have revolutionized how we access and use information but have also made archiving an increasingly complex task that requires active, continuing maintenance of digital media. This challenge has focused some interest on DNA as an attractive target for information storage because of its capacity for high-density information encoding, longevity under easily achieved conditions and proven track record as an information bearer. Previous DNA-based information storage approaches have encoded only trivial amounts of information or were not amenable to scaling-up, and used no robust error-correction and lacked examination of their cost-efficiency for large-scale information archival. Here we describe a scalable method that can reliably store more information than has been handled before. We encoded computer files totalling 739 kilobytes of hard-disk storage and with an estimated Shannon information of 5.2 × 10(6) bits into a DNA code, synthesized this DNA, sequenced it and reconstructed the original files with 100% accuracy. Theoretical analysis indicates that our DNA-based storage scheme could be scaled far beyond current global information volumes and offers a realistic technology for large-scale, long-term and infrequently accessed digital archiving. In fact, current trends in technological advances are reducing DNA synthesis costs at a pace that should make our scheme cost-effective for sub-50-year archiving within a decade.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/nature11875

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Goldman et al. (2013) encoded all 154 of Shakespeare's sonnets, a scientific article, a medium-resolution color photograph of the European Bioinformatics Institute, and a 26 s excerpt from Martin Luther King's speech using the Huffman algorithm.

    “The authors encoded all 154 of Shakespeare’s sonnets, a scientific article, a medium-resolution color photograph of the European Bioinformatics Institute, and a 26 s long excerpt from Martin Luther King’s 1963 “I have a dream” speech using the Huffman algorithm to covert numeric data into a nucleotide sequence [16].”

    From DNA Data Storage. (2023) · cites this paper as [16]

  • A base-3 Huffman code system developed by researchers at the European Bioinformatics Institute significantly increased the scale, density, and reliability of data storage in DNA.

    “researchers of European Bioinformatics Institute developed a base-3 Huffman code system that significantly increased the scale, density, and reliability of data storage in DNA (Goldman et al., 2013).”
  • Goldman et al.'s coding scheme was ill-suited for the used DNA channel because it had a low effective information rate and did not recover the whole message.

    “This coding scheme, however, was ill-suited for the used DNA channel because it had a low effective information rate, i.e., number of information bits per total number of encoded bits, and did not recover the whole message.”
  • Goldman et al. used an error-correction code where each part of the information was written on four subsequent DNA sequences, so loss of sequences could be corrected if fewer than four subsequent sequences were lost.

    “A simple example of an error-correction code was used by Goldman et al.,9 where each part of the information was written on four subsequent DNA sequences. Thus, the loss of sequences could be corrected if fewer than four subsequent sequences were lost.”
  • Demonstrations of DNA storage viability include the storage and retrieval of books, images, computer programs, audio clips, works of art, and Shakespeare's sonnets using a variety of encoding schemes, with data size limited primarily by the cost of DNA synthesis.

    “Demonstrations of its viability as a general information storage medium include the storage and retrieval of books, images, computer programs, audio clips, works of art, and Shakespeare’s sonnets using a variety of encoding schemes6–12, with data size limited primarily by the cost of DNA synthesis.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E. M., Sipos, B., & Birney, E.
Affiliations
  • European Bioinformatics Institute (GB)
  • Agilent Technologies (United States) (US)
Corresponding author
Goldman, Nick
Venue
Nature
Published
2013-01-23
Volume
494
Issue
7435
Pages
77-80
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W2162980030
Cited by
1,220
References
30
Citations by year
2026: 101 · 2025: 151 · 2024: 125 · 2023: 132 · 2022: 122 · 2021: 115 · 2020: 101 · 2019: 92 · 2018: 69 · 2017: 54 · 2016: 58 · 2015: 45 · 2014: 29 · 2013: 23
FWCI
23.27
Type
journal article
Language
en
Open access
Locations
  • Nature (publishedVersion)
  • PubMed (publishedVersion)
  • Europe PMC (PubMed Central) (acceptedVersion)
  • PubMed Central (acceptedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
Funders
  • Wellcome Trust (088151)
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (136461)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
Keywords
DNA data storage, synthetic DNA, digital archiving, error correction, DNA synthesis, long-term data preservation, information density, cost-effectiveness, DNA sequencing, Shannon information
MeSH terms
Archives, Base Sequence, Computers, DNA, Molecular Sequence Data, Sequence Analysis, DNA, Information Management, Synthetic Biology

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