ArticleNature communications2022
Robust data storage in DNA by de Bruijn graph-based de novo strand assembly.
Article in Nature communications, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 36 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
36 citing papers in PubMed, 86 citations in OpenAlex.
- Polus: a context-aware enhancement framework for DNA storage via transformer-based soft-decision decoding.Bioinformatics (Oxford, England) · 2026Article
- DNA Data Storage Architecture via Ligation of Dynamic DNA Bytes.Small methods · 2026Article
- ZAT-DNA enables DNA data storage with molecular-layer non-replicability.Nature communications · 2026Article
- From spacecraft ranging to massive DNA data storage: Composite ranging codes as indices and error correction references.Science advances · 2026Article
- Comparison of state-of-the-art error-correction coding for sequence-based DNA data storage.Nature communications · 2026Article
- DNA diamond formulates a decomposable composite letter constellation model for DNA data storage.Nature communications · 2026Article
- ProGenFixer: An Ultrafast and Accurate Tool for Correcting Prokaryotic Genome Sequences Using a Mapping-Free Algorithm.Computational and structural biotechnology journal · 2026Article
- Two-dimensional data storage using a DNA molecular register.Frontiers in bioengineering and biotechnology · 2026Article
- Linked data storage using DNA origami nanostructures.Nature communications · 2025Article
- DVOUG enables robust DNA sequence assembly and reconstruction with a dynamic, variable-order graph.Cell reports methods · 2025Article
- Efficient trace reconstruction in DNA storage systems using bidirectional beam search.iScience · 2025Article
- Approaching single-molecule assembly-free readout from medium-length encoded DNA.Nature communications · 2025Article
- De-Bruijn graph partitioning for scalable and accurate DNA storage processing.Bioinformatics (Oxford, England) · 2025Article
- DNA StairLoop: enabling high-fidelity data recovery and robust error correction in DNA-based data storage.Nature communications · 2025Article
- Predicting sequence-specific amplification efficiency in multi-template PCR with deep learning.Nature communications · 2025Article
- Achieving handle-level random access in an encrypted DNA archival storage system via frequency dictionary mapping coding.Patterns (New York, N.Y.) · 2025Article
- DNA-CTMF: Reconstruct high quality image from lossy DNA storage via Pixel-Base codebook and median filter.Synthetic and systems biotechnology · 2025Article
- Dna-storalator: a computational simulator for DNA data storage.BMC bioinformatics · 2025Article
- DNA storage: The future direction for medical cold data storage.Synthetic and systems biotechnology · 2025Review
- De novo non-canonical nanopore basecalling enables private communication using heavily-modified DNA data at single-molecule level.Nature communications · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
12 authors at 6 institutions in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
DNA data storage is a rapidly developing technology with great potential due to its high density, long-term durability, and low maintenance cost. The major technical challenges include various errors, such as strand breaks, rearrangements, and indels that frequently arise during DNA synthesis, amplification, sequencing, and preservation. In this study, a de novo strand assembly algorithm (DBGPS) is developed using de Bruijn graph and greedy path search to meet these challenges. DBGPS shows substantial advantages in handling DNA breaks, rearrangements, and indels. The robustness of DBGPS is demonstrated by accelerated aging, multiple independent data retrievals, deep error-prone PCR, and large-scale simulations. Remarkably, 6.8 MB of data is accurately recovered from a severely corrupted sample that has been treated at 70 °C for 70 days. With DBGPS, we are able to achieve a logical density of 1.30 bits/cycle and a physical density of 295 PB/g.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.