ArticleBriefings in bioinformatics2026
Modeling DNA storage retrieval reliability via sequencing coverage depth.
Article in Briefings in bioinformatics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
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
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
DNA storage offers exceptional durability and density but remains constrained by high sequencing cost and limited throughput. Sequencing coverage depth is a key determinant of retrieval reliability and sequencing efficiency, yet its quantitative characterization requires realistic modeling of channel nonuniformity beyond idealized uniform assumptions. In this work, we develop a nonuniform coverage-depth analysis framework for DNA storage channels by modeling polymerase chain reaction and sequencing data, with a log-normal instantiation for the empirical channel distribution. The proposed framework covers both nonuniform noiseless and noisy channels and is used to analyze the MDS coverage depth problem. For the noiseless case, we derive the expected minimum sequencing coverage depth required for complete decoding under a nonuniform channel distribution. For the noisy case, we present two complementary theories: a coupon-collector-problem-based (CCP) theory that provides a conservative probabilistic envelope, and a critical-quantile-based theory (CQT) that refines the estimate by identifying the key coverage-depth range that determines whether most strands are recovered. We further compare the uniform-channel theory, CCP theory, and CQT theory across multiple code rates and retrieval parameters through extensive Monte Carlo simulations. To support practical use, we also develop an interactive web platform for parameter tuning and visualization. The resulting theory and platform provide theoretical foundations and practical tools for improving retrieval reliability and sequencing efficiency in DNA storage systems.
Indexed as
Identifiers
What Socratic 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 Socratic graph.