Where DNA data storage loses its bits

Abstract DNA data storage is judged by bits stored per synthesized nucleotide, yet it is rarely known where an experiment loses the bits it does not store. Here we fit position-dependent insertion–deletion–substitution channels to the raw reads of 17 public datasets, prove capacity bounds for them and measure information rates on the reads. A model-based accounting indicates that sampling dominates the losses of low-error array pools read by Illumina: at low sequencing depth, unread strands, uneven coverage and indexing cost 0.2–0.35 bits per nucleotide, against less than 0.01 for sequence errors. Error-prone chemistries leave 0.04–0.26 bits between genie information and achieved rates, and designs that forbid repeated bases cap density at 1.59 bits per nucleotide. In a prespecified, paired test on fresh files, an iterative soft receiver with sparse pilot bases needed 7–42% fewer reads than Trellis BMA, the best published method, on eight of nine datasets. The released software places any dataset against its own losses.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-13
DOI
https://doi.org/10.21203/rs.3.rs-11653509/v1
Primary Topic
DNA and Biological Computing
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Where DNA data storage loses its bits

Hassan Khodaiemehr, Malihe Aliasgari, Chen Feng
1 links
Research Square
DNA and Biological Computing
preprint

Where DNA data storage loses its bits

Hassan Khodaiemehr, Malihe Aliasgari, Chen Feng
preprint en

Abstract

Abstract DNA data storage is judged by bits stored per synthesized nucleotide, yet it is rarely known where an experiment loses the bits it does not store. Here we fit position-dependent insertion–deletion–substitution channels to the raw reads of 17 public datasets, prove capacity bounds for them and measure information rates on the reads. A model-based accounting indicates that sampling dominates the losses of low-error array pools read by Illumina: at low sequencing depth, unread strands, uneven coverage and indexing cost 0.2–0.35 bits per nucleotide, against less than 0.01 for sequence errors. Error-prone chemistries leave 0.04–0.26 bits between genie information and achieved rates, and designs that forbid repeated bases cap density at 1.59 bits per nucleotide. In a prespecified, paired test on fresh files, an iterative soft receiver with sparse pilot bases needed 7–42% fewer reads than Trellis BMA, the best published method, on eight of nine datasets. The released software places any dataset against its own losses.

Research Square
University of British Columbia (CA), Kean University (US)
DNA and Biological Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon