ArticleNAR genomics and bioinformatics2022
High-scale random access on DNA storage systems.
Article in NAR genomics and bioinformatics, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 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
10 citing papers in PubMed.
- Electric field-guided random-access DNA data storage.Science advances · 2026Article
- Data recovery methods for DNA storage based on fountain codes.Computational and structural biotechnology journal · 2024Article
- Optimizing fountain codes for DNA data storage.Computational and structural biotechnology journal · 2024Article
- Article
- Storage-D: A user-friendly platform that enables practical and personalized DNA data storage.iMeta · 2024Article
- DNA-Aeon provides flexible arithmetic coding for constraint adherence and error correction in DNA storage.Nature communications · 2023Article
- RepairNatrix: a Snakemake workflow for processing DNA sequencing data for DNA storage.Bioinformatics advances · 2023Article
- DNAsmart: Multiple attribute ranking tool for DNA data storage systems.Computational and structural biotechnology journal · 2023Article
- Design considerations for advancing data storage with synthetic DNA for long-term archiving.Materials today. Bio · 2022Review
- 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
4 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Due to the rapid cost decline of synthesizing and sequencing deoxyribonucleic acid (DNA), high information density, and its durability of up to centuries, utilizing DNA as an information storage medium has received the attention of many scientists. State-of-the-art DNA storage systems exploit the high capacity of DNA and enable random access (predominantly random reads) by primers, which serve as unique identifiers for directly accessing data. However, primers come with a significant limitation regarding the maximum available number per DNA library. The number of different primers within a library is typically very small (e.g. ≈10). We propose a method to overcome this deficiency and present a general-purpose technique for addressing and directly accessing thousands to potentially millions of different data objects within the same DNA pool. Our approach utilizes a fountain code, sophisticated probe design, and microarray technologies. A key component is locality-sensitive hashing, making checks for dissimilarity among such a large number of probes and data objects feasible.
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.