Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; the references it cites are not checked yet.

A Rewritable, Random-Access DNA-Based Storage System

Open access
Tabatabaei Yazdi, S. M. Hossein, Yuan, Yongbo, Ma, Jian, Zhao, Huimin, Milenkovic, Olgica · 2015 · Scientific Reports

Abstract

We describe the first DNA-based storage architecture that enables random access to data blocks and rewriting of information stored at arbitrary locations within the blocks. The newly developed architecture overcomes drawbacks of existing read-only methods that require decoding the whole file in order to read one data fragment. Our system is based on new constrained coding techniques and accompanying DNA editing methods that ensure data reliability, specificity and sensitivity of access and at the same time provide exceptionally high data storage capacity. As a proof of concept, we encoded parts of the Wikipedia pages of six universities in the USA and selected and edited parts of the text written in DNA corresponding to three of these schools. The results suggest that DNA is a versatile media suitable for both ultrahigh density archival and rewritable storage applications.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1038/srep14138

Cites

Statistics

Figures

Figure 1 (a) The scheme of4 uses a storage format consisting of DNA strings that cover the encoded compressed text in fragments of length of 100 bps. The fragments overlap in 75 bps, thereby providing 4-fold coverage for all except the flanking end bases. This particular fragmenting procedure prevents efficient file editing: If one were to rewrite the “shaded” block, all four fragments containing this block would need to be selected and rewritten at different positions to record the new “shaded” block. (b) The address sequence construction process we propose which uses the notions of autocorrelation and cross-correlation of sequences13. A sequence is uncorrelated with itself if no proper prefix of the sequence is also a suffix of the same sequence. Alternatively, no shift of the sequence overlaps with the sequence itself. Similarly, two different sequences are uncorrelated if no prefix of one sequence matches a suffix of the other. Addresses are chosen to be mutually uncorrelated, and each 1000 bps block is flanked by an address of length 20 on the left and by another address of length 20 on the right (colored ends). (c) Content rewriting via DNA editing: the gBlock method10 for short rewrites, and the cost efficient OE-PCR (Overlap Extension PCR) method11 for sequential rewriting of longer blocks.
Figure 1 (a) The scheme of4 uses a storage format consisting of DNA strings that cover the encoded compressed text in fragments of length of 100 bps. The fragments overlap in 75 bps, thereby providing 4-fold coverage for all except the flanking end bases. This particular fragmenting procedure prevents efficient file editing: If one were to rewrite the “shaded” block, all four fragments containing this block would need to be selected and rewritten at different positions to record the new “shaded” block. (b) The address sequence construction process we propose which uses the notions of autocorrelation and cross-correlation of sequences13. A sequence is uncorrelated with itself if no proper prefix of the sequence is also a suffix of the same sequence. Alternatively, no shift of the sequence overlaps with the sequence itself. Similarly, two different sequences are uncorrelated if no prefix of one sequence matches a suffix of the other. Addresses are chosen to be mutually uncorrelated, and each 1000 bps block is flanked by an address of length 20 on the left and by another address of length 20 on the right (colored ends). (c) Content rewriting via DNA editing: the gBlock method10 for short rewrites, and the cost efficient OE-PCR (Overlap Extension PCR) method11 for sequential rewriting of longer blocks.CC BY · PubMed Central
Figure 2 (a) Gel electrophoresis results for three blocks, indicating that the length of the three selected and amplified sequences is tightly concentrated around 1000 bps, and hence correct. (b) Output of the Sanger sequencer, where all bases shaded in yellow correspond to correct readouts. The sequencing results confirmed that the desired sequences were selected, amplified, and rewritten with 100% accuracy.
Figure 2 (a) Gel electrophoresis results for three blocks, indicating that the length of the three selected and amplified sequences is tightly concentrated around 1000 bps, and hence correct. (b) Output of the Sanger sequencer, where all bases shaded in yellow correspond to correct readouts. The sequencing results confirmed that the desired sequences were selected, amplified, and rewritten with 100% accuracy.CC BY · PubMed Central

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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?

2 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Self-check

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

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

Citations

The citation lists are queued

They are fetched later and appear here then.

References 22 · Cited by 401

Research works printed but not linked: 1

  1. Blackburn, S. R. Non-overlapping codes. arXiv preprint arXiv:1303.1026 (2013). · arXiv

Metadata

Authors
Tabatabaei Yazdi, S. M. H., Yuan, Y., Ma, J., Zhao, H., & Milenkovic, O.
Affiliations
University of Illinois Urbana-Champaign (US)
Venue
Scientific Reports
Published
2015-09-18
Volume
5
Issue
1
Pages
14138-14138
ISSN
2045-2322 (ISSN-L)
OpenAlex
W1946587648
Cited by
401
References
22
Citations by year
2026: 21 · 2025: 48 · 2024: 42 · 2023: 42 · 2022: 50 · 2021: 47 · 2020: 44 · 2019: 40 · 2018: 23 · 2017: 24 · 2016: 17 · 2015: 3
FWCI
9.69
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation
  • Purdue University
  • University of Illinois at Urbana-Champaign
Topics
  • Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
Keywords
DNA data storage, random access, constrained coding, DNA editing, data reliability, storage capacity, archival storage
MeSH terms
Algorithms, DNA, Information Science, Models, Theoretical, Technology, 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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Rewritable, Random-Access DNA-Based Storage System. https://app.cochat.ai/papers/10.1038/srep14138
The paper
Tabatabaei Yazdi, S. M. H., Yuan, Y., Ma, J., Zhao, H., & Milenkovic, O. (2015). A Rewritable, Random-Access DNA-Based Storage System. Scientific Reports. https://doi.org/10.1038/srep14138

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.