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 条
  • [21] An information-theoretic approach to single cell sequencing analysis
    Michael J. Casey
    Jörg Fliege
    Rubén J. Sánchez-García
    Ben D. MacArthur
    BMC Bioinformatics, 24
  • [22] An information-theoretic approach to single cell sequencing analysis
    Casey, Michael J.
    Fliege, Joerg
    Sanchez-Garcia, Ruben J.
    MacArthur, Ben D.
    BMC BIOINFORMATICS, 2023, 24 (01)
  • [23] Information-Theoretic Regret Bounds for Bandits with Fixed Expert Advice
    Eldowa, Khaled
    Cesa-Bianchi, Nicolo
    Metelli, Alberto Maria
    Restelli, Marcello
    2023 IEEE INFORMATION THEORY WORKSHOP, ITW, 2023, : 30 - 35
  • [24] Information-theoretic lower bounds for convex optimization with erroneous oracles
    Singer, Yaron
    Vondrak, Jan
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [25] An information-theoretic approach to combining object models
    Kruppa, H
    Schiele, B
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2002, 39 (3-4) : 195 - 203
  • [26] Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithms
    Aminian, Gholamali
    Toni, Laura
    Rodrigues, Miguel R. D.
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 682 - 687
  • [27] Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds
    Reeves, Galen
    Gastpar, Michael C.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (06) : 3451 - 3465
  • [28] Statistical and Information-Theoretic Optimization and Performance Bounds of Video Steganography
    Sharifzadeh, Mehdi
    Schonfeld, Dan
    2015 53RD ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2015, : 1454 - 1457
  • [29] Information-theoretic evaluation of covariate distributions models
    Niklas Hartung
    Aleksandra Khatova
    Journal of Pharmacokinetics and Pharmacodynamics, 2025, 52 (2)
  • [30] New Bounds on the Information-Theoretic Key Agreement of Multiple Terminals
    Gohari, Amin Aminzadeh
    Anantharam, Venkat
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 742 - 746