ArticleInterdisciplinary sciences, computational life sciences2022
A Hierarchical Error Correction Strategy for Text DNA Storage.
Article in Interdisciplinary sciences, computational life sciences, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 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
8 citing papers in PubMed.
- DNA-CTMF: Reconstruct high quality image from lossy DNA storage via Pixel-Base codebook and median filter.Synthetic and systems biotechnology · 2025Article
- Predict the degree of secondary structures of the encoding sequences in DNA storage by deep learning model.Scientific reports · 2025Article
- DNA storage: The future direction for medical cold data storage.Synthetic and systems biotechnology · 2025Review
- INNSE: Invertible neural network-based DNA image storage with self-correction encoding.Computational and structural biotechnology journal · 2025Article
- A generative adversarial network for multiple reads reconstruction in DNA storage.Scientific reports · 2024Article
- A dual-rule encoding DNA storage system using chaotic mapping to control GC content.Bioinformatics (Oxford, England) · 2024Article
- Hidden Addressing Encoding for DNA Storage.Frontiers in bioengineering and biotechnology · 2022Article
- Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
Abstract
DNA storage has been a thriving interdisciplinary research area because of its high density, low maintenance cost, and long durability for information storage. However, the complexity of errors in DNA sequences including substitutions, insertions and deletions hinders its application for massive data storage. Motivated by the divide-and-conquer algorithm, we propose a hierarchical error correction strategy for text DNA storage. The basic idea is to design robust codes for common characters which have one-base error correction ability including insertion and/or deletion. The errors are gradually corrected by the codes in DNA reads, multiple alignment of character lines, and finally word spelling. On one hand, the proposed encoding method provides a systematic way to design storage friendly codes, such as 50% GC content, no more than 2-base homopolymers, and robustness against secondary structures. On the other hand, the proposed error correction method not only corrects single insertion or deletion, but also deals with multiple insertions or deletions. Simulation results demonstrate that the proposed method can correct more than 98% errors when error rate is less than or equal to 0.05. Thus, it is more powerful and adaptable to the complicated DNA storage applications.
Indexed as
Identifiers
34463928What 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.