PreprintCited by 27DNA and Biological ComputingAlgorithms and Data CompressionFractal and DNA sequence analysis

A robust and efficient DNA storage architecture based on modulation encoding and decoding

Open access
Zan, Xiangzhen, Xie, Ranze, Yao, Xiangyu, Xu, Peng, Liu, Wenbin·2022·Journal of Chemical Information and Modeling

Abstract

Thanks to its high density and long durability, synthetic DNA has been widely considered as a promising solution to the data explosion problem. However, due to the large amount of random base insertion-deletion-substitution (IDSs) errors from sequencing, reliable data recovery remains a critical challenge, which hinders its large-scale application. Here, we propose a modulation-based DNA storage architecture. Experiments on simulation and real datasets demonstrate that it has two distinct advantages. First, modulation encoding provides a simple way to ensure the encoded DNA sequences comply with biological sequence constraints (i.e., GC balanced and no homopolymers); Second, modulation decoding is highly efficient and extremely robust for the detection of insertions and deletions, which can correct up to ~40% errors. These two advantages pave the way for future high-throughput and low-cost techniques, and will kickstart the actualization of a viable, large-scale system for DNA data storage.

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.1101/2022.05.25.490755

Cites

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

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

1 retracted

Flagged first, then by citations

Research works printed but not linked: 3

  1. Davey, M.C. & Mackay, D.J.C. in 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060) 477 (2000).
  2. Song, L., Geng, F., Gong, Z., Li, B. & Yuan, Y. Super-robust data storage in DNA by de Bruijn graph-based decoding. bioRxiv, 2020.2012.2020.423642 (2020).
  3. Xiangzhen ZAN et al. An Efficient Bueket-allocation Decoding Method Based on Forward Error Correction Codes for Deoxyribo Nucleicecid Storage. Journal of Electronics and Information Technology 44, 1-7 (2021).

Cited by

Sorted by citations

Authors
Zan, X., Xie, R., Yao, X., Xu, P., & Liu, W.
Affiliations
Guangzhou University (CN)
Corresponding author
  • Xu, Peng
  • Liu, Wenbin
Venue
Journal of Chemical Information and Modeling
Publisher
openRxiv
Published
2022-05-25
Volume
63
Issue
12
Pages
3967-3976
ISSN
1549-9596 (ISSN-L)
OpenAlex
W4379769333
Cited by
27
References
33
Citations by year
2026: 7 · 2025: 7 · 2024: 9 · 2023: 3 · 2022: 1
FWCI
2.31
Type
journal article
Language
en
Open access
Locations
  • Journal of Chemical Information and Modeling (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion)
  • PubMed (publishedVersion)
Funders
  • National Natural Science Foundation of China (62002079, 62072128)
  • Natural Science Foundation of Guangdong Province (2023A1515011401)
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, synthetic DNA, error detection, storage density
MeSH terms
Computer Simulation, DNA, Information Storage and Retrieval, Sequence Analysis, DNA

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