Cited by 77DNA and Biological ComputingAdvanced Data Storage TechnologiesAlgorithms and Data Compression

A DNA-Based Archival Storage System

Open access
Bornholt, James, Lopez, Randolph, Carmean, Douglas M., Ceze, Luis, Seelig, Georg, Strauss, Karin·2016·ACM SIGOPS Operating Systems Review

Abstract

Demand for data storage is growing exponentially, but the capacity of existing storage media is not keeping up. Using DNA to archive data is an attractive possibility because it is extremely dense, with a raw limit of 1 exabyte/mm3 (109 GB/mm3), and long-lasting, with observed half-life of over 500 years. This paper presents an architecture for a DNA-based archival storage system. It is structured as a key-value store, and leverages common biochemical techniques to provide random access. We also propose a new encoding scheme that offers controllable redundancy, trading off reliability for density. We demonstrate feasibility, random access, and robustness of the proposed encoding with wet lab experiments involving 151 kB of synthesized DNA and a 42 kB random-access subset, and simulation experiments of larger sets calibrated to the wet lab experiments. Finally, we highlight trends in biotechnology that indicate the impending practicality of DNA storage for much larger datasets.

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.1145/2954680.2872397

Cites

24 of 24 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?

  • Sequencing coverage of oligonucleotides in DNA data storage systems is very uneven, requiring modern error correction codes capable of handling sequence dropout.

    “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 [11]

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

Research works printed but not linked: 1

  1. [25]25. Sony. Sony develops magnetic tape technology with the world's highest recording density. http://www.sony. net/SonyInfo/News/Press/201404/14-044E/, 2014.

Cited by

Sorted by citations

Authors
Bornholt, J., Lopez, R., Carmean, D. M., Ceze, L., Seelig, G., & Strauss, K.
Affiliations
  • University of Washington (US)
  • Microsoft (United States) (US)
  • University of Washington, Seattle, WA, USA
Venue
ACM SIGOPS Operating Systems Review
Published
2016-03-25
Volume
50
Issue
2
Pages
637-649
ISSN
0163-5980 (ISSN-L)
OpenAlex
W4234461109
Cited by
77
References
24
Citations by year
2026: 4 · 2025: 1 · 2024: 6 · 2023: 8 · 2022: 5 · 2021: 11 · 2020: 11 · 2019: 15 · 2018: 11 · 2017: 4 · 2016: 1
FWCI
5.34
Type
journal article
Language
en
Open access
Locations
ACM SIGOPS Operating Systems Review (publishedVersion)
Funders
National Science Foundation (1409831)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
Keywords
DNA data storage, archival storage, key-value stores, random access, redundancy, storage density, storage reliability, DNA synthesis, storage architecture

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