Models and information-theoretic bounds for nanopore sequencing

被引:0
作者
Mao, Wei
Diggavi, Suhas
Kannan, Sreeram
机构
来源
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2017年
基金
美国国家科学基金会;
关键词
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 条
  • [31] Information-Theoretic Generalization Bounds for Meta-Learning and Applications
    Jose, Sharu Theresa
    Simeone, Osvaldo
    ENTROPY, 2021, 23 (01) : 1 - 28
  • [32] An information-theoretic approach to combining object models
    Kruppa, H
    Schiele, B
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2002, 39 (3-4) : 195 - 203
  • [33] INFORMATION-THEORETIC ANALYSIS OF STOCHASTIC VOLATILITY MODELS
    Pfante, Oliver
    Bertschinger, Nils
    ADVANCES IN COMPLEX SYSTEMS, 2019, 22 (01):
  • [34] Decoding from Pooled Data: Sharp Information-Theoretic Bounds
    El Alaoui, Ahmed
    Ramdas, Aaditya
    Krzakala, Florent
    Zdeborova, Lenka
    Jordan, Michael, I
    SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2019, 1 (01): : 161 - 188
  • [35] Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation
    Xu, Aolin
    Raginsky, Maxim
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (03) : 1580 - 1600
  • [36] Fundamental Error Bounds in State Estimation: An Information-Theoretic Analysis
    Fang, Song
    Chen, Jie
    Ishii, Hideaki
    2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [37] AN INFORMATION-THEORETIC APPROACH TO TIME-BOUNDS FOR ONLINE COMPUTATION
    PAUL, WJ
    SEIFERAS, JI
    SIMON, J
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 23 (02) : 108 - 126
  • [38] Information-Theoretic Bounds for Multiround Function Computation in Collocated Networks
    Ma, Nan
    Ishwar, Prakash
    Gupta, Piyush
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2306 - +
  • [39] Information-Theoretic Lower Bounds for Recovery of Diffusion Network Structures
    Park, Keehwan
    Honorio, Jean
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1346 - 1350
  • [40] INFORMATION-THEORETIC BOUNDS FOR AUTHENTICATION CODES AND BLOCK-DESIGNS
    PEI, DY
    JOURNAL OF CRYPTOLOGY, 1995, 8 (04) : 177 - 188