Cited by 80DNA and Biological ComputingError Correcting Code TechniquesAdvanced Data Storage Technologies

Improved read/write cost tradeoff in DNA-based data storage using LDPC codes

Open access
Chandak, Shubham, Tatwawadi, Kedar, Lau, Billy, Mardia, Jay, Kubit, Matthew, Neu, Joachim, Griffin, Peter, Wootters, Mary +2 more·2019·2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

Abstract

With the amount of data being stored increasing rapidly, there is significant interest in exploring alternative storage technologies. In this context, DNA-based storage systems can offer significantly higher storage densities (petabytes/gram) and durability (thousands of years) than current technologies. Specifically, DNA has been found to be stable over extended periods of time which has been demonstrated in the analysis of organisms long since extinct. Recent advances in DNA sequencing and synthesis pipelines have made DNA-based storage a promising candidate for the storage technology of the future.Recently, there have been multiple efforts in this direction, focusing on aspects such as error correction for synthesis/sequencing errors and erasure correction for handling missing sequences. The typical approach is to use separate codes for handling errors and erasures, but there is limited understanding of the efficiency of this framework. Furthermore, the existing techniques use short block-length codes and heavily rely on read consensus, both of which are known to be suboptimal in coding theory.In this work, we study the tradeoff between the writing and reading costs involved in DNA-based storage and propose a practical scheme to achieve an improved tradeoff between these quantities. Our scheme breaks with the traditional separation framework and instead uses a single large block-length LDPC code for both erasure and error correction. We also introduce novel techniques to handle insertion and deletion errors introduced by the synthesis process. For a range of writing costs, the proposed scheme achieves 30-40% lower reading costs than state-of-the-art techniques on experimental data obtained using array synthesis and Illumina sequencing.The code, data, and Supplementary Material is available at https://github.com/shubhamchandak94/LDPC_ DNA_storage.

Integrity signals

Registry

Crossref · 10.1109/allerton.2019.8919890

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chandak, S., Tatwawadi, K., Lau, B., Mardia, J., Kubit, M., Neu, J., Griffin, P., Wootters, M., Weissman, T., & Ji, H.
Affiliations
Stanford University (US)
Corresponding author
Chandak, Shubham
Venue
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
IEEE
Published
2019-09
Pages
147-156
OpenAlex
W2993276217
Cited by
80
References
32
Citations by year
2026: 10 · 2025: 9 · 2024: 16 · 2023: 14 · 2022: 12 · 2021: 10 · 2020: 7 · 2019: 2
FWCI
21.55
Type
conference paper
Language
en
Open access
Locations
  • Allerton Conference on Communication, Control, and Computing (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc)
Funders
National Science Foundation (1807371)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
  • Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
Keywords
DNA data storage, LDPC codes, erasure correction, error correction, insertion and deletion errors, DNA sequencing errors

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