Cited by 100DNA and Biological ComputingAdvanced biosensing and bioanalysis techniquesAdvanced Data Storage Technologies

Driving the Scalability of DNA-Based Information Storage Systems

Open access
Tomek, Kyle J., Volkel, Kevin, Simpson, Alexander, Hass, Austin G., Indermaur, Elaine W., Tuck, James M., Keung, Albert J.·2019·ACS Synthetic Biology

Published version of a preprint

Abstract

The extreme density of DNA presents a compelling advantage over current storage media; however, to reach practical capacities, new systems for organizing and accessing information are needed. Here, we use chemical handles to selectively extract unique files from a complex database of DNA mimicking 5 TB of data and design and implement a nested file address system that increases the theoretical maximum capacity of DNA storage systems by five orders of magnitude. These advancements enable the development and future scaling of DNA-based data storage systems with modern capacities and file access capabilities.

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.1021/acssynbio.9b00100

Cites

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

  • A different method of random access using bead extraction utilized 10^18 unique sequences.

    “In more recent work, a different method of random access using bead extraction of desired strands prior to PCR random access utilized 1018 unique sequences11.”

    From Probing the physical limits of reliable DNA data retrieval. (2020) · cites this paper as [11]

  • Incorporation of random-access priming regions into each oligo decreases the available space for data-encoding bases, thereby decreasing storage density, currently by about 15% per address region.

    “First, the incorporation of random-access priming regions into each oligo decreases the available space for data-encoding bases, thereby also decreasing the storage density (currently by about 15% per address region).71,75”
  • Currently, the highest demonstrated data capacity for random access is on the order of terabytes of data.

    “Currently, the highest demonstrated data capacity for random access is on the order of terabytes of data.6,12,71”
  • Biotin-labeled primers can be used to address and extract specific files via streptavidin magnetic beads based on file-specific random access regions in encoding oligos.

    “As mentioned above, biotin-labeled primers can be used to address and extract specific files via streptavidin magnetic beads on the basis of file-specific random access regions in encoding oligos, similarly to PCR-based addressing.71,78”
  • Nested addressing barcodes have been used to uniquely identify a greater number of files, and biochemical affinity tags have been used to selectively pull down oligos for targeted amplification.

    “Nested addressing barcodes14–16 have also been used to uniquely identify a greater number of files, as well as biochemical affinity tags to selectively pull down oligos for targeted amplification17.”

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
Tomek, K. J., Volkel, K., Simpson, A., Hass, A. G., Indermaur, E. W., Tuck, J. M., & Keung, A. J.
Affiliations
North Carolina State University (US)
Corresponding author
  • Tuck, James M.
  • Keung, Albert J.
Venue
ACS Synthetic Biology
Published
2019-05-22
Volume
8
Issue
6
Pages
1241-1248
ISSN
2161-5063 (ISSN-L)
OpenAlex
W2951989222
Cited by
100
References
20
Citations by year
2026: 16 · 2025: 18 · 2024: 16 · 2023: 14 · 2022: 11 · 2021: 16 · 2020: 7 · 2019: 2
FWCI
2.98
Type
journal article
Language
en
Open access
Locations
  • ACS Synthetic Biology (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
Funders
  • North Carolina State University (2018-2509)
  • North Carolina Biotechnology Center
  • National Science Foundation (CNS-1650148)
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 › Computer Networks and Communications › Advanced Data Storage Technologies
Keywords
DNA data storage, scalability, file retrieval, storage capacity, synthetic DNA, information storage systems
MeSH terms
DNA, Information Storage and Retrieval, Sequence Analysis, DNA, Databases, Nucleic Acid, Synthetic Biology, 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