Models and information-theoretic bounds for nanopore sequencing

被引:0
|
作者
Mao, Wei
Diggavi, Suhas
Kannan, Sreeram
机构
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nanopore sequencing is an emerging new technology for sequencing DNA, which can read long fragments of DNA (similar to 50,000 bases) unlike most current sequencers which can only read hundreds of bases. While nanopore sequencers can acquire long reads, the high error rates (approximate to 30%) pose a technical challenge. In a nanopore sequencer, a DNA is migrated through a nanopore and current variations are measured. The DNA sequence is inferred from this observed current pattern using an algorithm called a base-caller. In this paper, we propose a mathematical model for the "channel" from the input DNA sequence to the observed current, and calculate bounds on the information extraction capacity of the nanopore sequencer. This model incorporates impairments like inter-symbol interference, deletions, as well as random response. The practical application of such information bounds is two-fold: (1) benchmarking present base-calling algorithms, and (2) offering an optimization objective for designing better nanopore sequencers.
引用
收藏
页码:2458 / 2462
页数:5
相关论文
共 50 条
  • [1] Models and Information-Theoretic Bounds for Nanopore Sequencing
    Mao, Wei
    Diggavi, Suhas N.
    Kannan, Sreeram
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (04) : 3216 - 3236
  • [2] Information-theoretic lower bounds for compressive sensing with generative models
    Liu Z.
    Scarlett J.
    IEEE Journal on Selected Areas in Information Theory, 2020, 1 (01): : 292 - 303
  • [3] Structure Learning of Similar Ising Models: Information-theoretic Bounds
    Sihag, Saurabh
    Tajer, Ali
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 1307 - 1311
  • [4] Information-Theoretic Bounds for Integral Estimation
    Adams, Donald Q.
    Batik, Adarsh
    Honorio, Jean
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 742 - 747
  • [5] Intrinsic Information-Theoretic Models
    Bernal-Casas, D.
    Oller, J. M.
    ENTROPY, 2024, 26 (05)
  • [6] Strengthened Information-theoretic Bounds on the Generalization Error
    Issa, Ibrahim
    Esposito, Amedeo Roberto
    Gastpar, Michael
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 582 - 586
  • [7] Information-Theoretic Bounds for Adaptive Sparse Recovery
    Aksoylar, Cem
    Saligrama, Venkatesh
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1311 - 1315
  • [8] Information-theoretic bounds for steganography in visual multimedia
    El-Arsh, Hassan Y.
    Abdelaziz, Amr
    Elliethy, Ahmed
    Aly, H. A.
    Gulliver, T. Aaron
    JOURNAL OF INFORMATION SECURITY AND APPLICATIONS, 2025, 89
  • [9] Information-Theoretic Confidence Bounds for Reinforcement Learning
    Lu, Xiuyuan
    Van Roy, Benjamin
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [10] Information-theoretic bounds on target recognition performance
    Jain, A
    Moulin, P
    Miller, MI
    Ramchandran, K
    AUTOMATIC TARGET RECOGNITION X, 2000, 4050 : 347 - 358