Skip to content
DraconiticResearch
Search Sources API
201,818 studies31 sourcesUpdated 15 min ago
PreprintCC BY 4.0arXiv

Probabilistic GC-Constraints for Composite DNA

Abstract

This paper addresses the challenge of encoding biochemical GC-content constraints in composite DNA-based data storage. Previous deterministic models impose high rate penalties by avoiding any possibility for a strand to fall outside the allowed range. To account for the stochastic nature of composite DNA, we introduce an ε-probabilistic constraint framework, and derive capacity bounds for global constraints using composition types and for local sliding-window constraints via finite-state Markov chains. Furthermore, we propose a capacity-achieving multi-type enumerative encoder.

Related

  1. RiboBA: a bias-aware probabilistic framework for robust ORF identification across diverse ribosome profiling protocols
    Nucleic acids researchPeer-reviewedCC BYFull textMolecular biology & gene regulationEurope PMC
  2. Bayesian Gaussian process inference of RNA velocity as a probabilistic vector field on single-cell manifolds
    A. S. M. Bakibillah, Hampei Sasahara, Jun-ichi Imura
    Scientific ReportsPeer-reviewedCC BY-NC-ND 4.0Full textMolecular biology & gene regulationCrossref
  3. LoL-align: sensitive and fast probabilistic protein structure alignment
    Lasse Reifenrath, Michel van Kempen, Gyuri Kim +6
    Nature MethodsPeer-reviewedCC BY 4.0Full text1 citedMolecular biology & gene regulationPMC
  4. Fast probabilistic whitening transformation for ultra-high dimensional genetic data
    Gabriel E. Hoffman, Christian P. Dillard, Kiran Girdhar +1
    PLOS GeneticsPeer-reviewedCC0Full textMolecular biology & gene regulationBioinformatics & computational biologyPLOSPMC
  5. ProteoEM: probabilistic protein abundance estimation from iterative affinity traces
    Narayanan Raghupathy
    arXivPreprintCC BY 4.0Full textBiophysicsBioinformatics & computational biologyarXiv
BibTeX
@misc{bodur2026probabilistic,
  title = {{Probabilistic GC-Constraints for Composite DNA}},
  author = {Humeyra Bodur and Frederik Walter and Antonia Wachter-Zeh},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09998},
  eprint = {2610.09998},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09998},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Probabilistic GC-Constraints for Composite DNA
AU  - Humeyra Bodur
AU  - Frederik Walter
AU  - Antonia Wachter-Zeh
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.09998
UR  - https://arxiv.org/abs/2610.09998
AB  - This paper addresses the challenge of encoding biochemical GC-content constraints in composite DNA-based data storage. Previous deterministic models impose high rate penalties by avoiding any possibility for a strand to fall outside the allowed range. To account for the stochastic nature of composite DNA, we introduce an ε-probabilistic constraint framework, and derive capacity bounds for global constraints using composition types and for local sliding-window constraints via finite-state Markov chains. Furthermore, we propose a capacity-achieving multi-type enumerative encoder.
ER  -