Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 11 min ago
PreprintCC BY 4.0arXiv

Information Rate Decomposition for Noisy Nanopore Channels with Geometric Duplication

Abstract

This paper studies information rates of noisy duplication channels with memory, motivated by nanopore DNA sequencing. In nanopore sequencing, the measured signal is affected by both inter-symbol interference (ISI), caused by multiple DNA bases residing in the pore, and random sample duplications, where variable translocation speed causes each base to generate a random number of samples. These two effects make direct theoretical analysis difficult. To address this, we derive a new decomposition of the information rate into two interpretable terms: one capturing the channel memory through an auxiliary ISI channel, and another capturing the uncertainty in the segment boundaries caused by random duplications. This decomposition separates the dominant channel distortions and replaces the direct analysis of the full channel with two more readily tractable components. We then study the second term through a soft alignment functional closely related to Soft-DTW, which yields a strong asymptotic equipartition property result and an alternative proof of the Markov-constrained coding theorem. Finally, we develop a lower bound on the information rate that depends on the distribution of jump distances between adjacent nanopore levels. This bound gives a simple geometric explanation of channel synchronisability and provides a tractable framework for computing achievable rates of Oxford nanopore sequencers.

Related

  1. Finite BSC-Decomposition of Binary-Input Symmetric-Output Channels and Applications to Channel Simulation
    Jianguo Zhao, Cheuk Ting Li
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. The geometric convergence of a parallel domain decomposition method on manifolds
    Lizhen Qin
    arXivPreprintarXiv licenceFull textGeometry & topologyNumerical analysis & scientific computingarXiv
  3. Geometric decomposition of the d-dimensional hard-sphere partition function
    Luke K. Davis
    arXivPreprintCC BY-NC-SA 4.0Full textMathematical physicsStatistical & nonlinear physicsarXiv
  4. No information transmission through quantum channels above capacity
    Hao-Chung Cheng, Marco Tomamichel
    arXivPreprintarXiv licenceFull textMathematical physicsQuantum physics & quantum informationarXiv
  5. Geometric mean and Lebesgue-type decomposition of completely positive maps
    Rui Okayasu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsMathematical physicsarXiv
BibTeX
@misc{mcbain2026information,
  title = {{Information Rate Decomposition for Noisy Nanopore Channels with Geometric Duplication}},
  author = {Brendon McBain and Emanuele Viterbo},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2606.06808},
  eprint = {2606.06808},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2606.06808},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Information Rate Decomposition for Noisy Nanopore Channels with Geometric Duplication
AU  - Brendon McBain
AU  - Emanuele Viterbo
PY  - 2026
DA  - 2026/09/07
PB  - arXiv
DO  - 10.48550/arxiv.2606.06808
UR  - https://arxiv.org/abs/2606.06808
AB  - This paper studies information rates of noisy duplication channels with memory, motivated by nanopore DNA sequencing. In nanopore sequencing, the measured signal is affected by both inter-symbol interference (ISI), caused by multiple DNA bases residing in the pore, and random sample duplications, where variable translocation speed causes each base to generate a random number of samples. These two effects make direct theoretical analysis difficult. To address this, we derive a new decomposition of the information rate into two interpretable terms: one capturing the channel memory through an auxiliary ISI channel, and another capturing the uncertainty in the segment boundaries caused by random duplications. This decomposition separates the dominant channel distortions and replaces the direct analysis of the full channel with two more readily tractable components. We then study the second term through a soft alignment functional closely related to Soft-DTW, which yields a strong asymptotic equipartition property result and an alternative proof of the Markov-constrained coding theorem. Finally, we develop a lower bound on the information rate that depends on the distribution of jump distances between adjacent nanopore levels. This bound gives a simple geometric explanation of channel synchronisability and provides a tractable framework for computing achievable rates of Oxford nanopore sequencers.
ER  -