메뉴 건너뛰기




Volumn 73, Issue 7, 2007, Pages 1060-1077

The most probable annotation problem in HMMs and its application to bioinformatics

Author keywords

Computational biology; Gene finding; Hidden Markov models; NP hardness; Sequence annotation

Indexed keywords

ALGORITHMS; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; HIDDEN MARKOV MODELS; PROTEINS;

EID: 34547119578     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.03.011     Document Type: Article
Times cited : (17)

References (21)
  • 1
    • 34547127457 scopus 로고    scopus 로고
    • C. Brabrand, R. Giegerich, A. Møller, Analyzing ambiguity of context-free grammars, Tech. Rep. RS-06-09, BRICS, May 2006
  • 2
    • 29144445262 scopus 로고    scopus 로고
    • ExonHunter: A comprehensive approach to gene finding
    • Intelligent Systems for Molecular Biology. ISMB 2005
    • Brejová B., Brown D.G., Li M., and Vinař T. ExonHunter: A comprehensive approach to gene finding. Intelligent Systems for Molecular Biology. ISMB 2005. Bioinformatics 21 Suppl 1 (2005) i57-i65
    • (2005) Bioinformatics , vol.21 , Issue.SUPPL. 1
    • Brejová, B.1    Brown, D.G.2    Li, M.3    Vinař, T.4
  • 3
    • 34547137975 scopus 로고    scopus 로고
    • C.B. Burge, Identification of genes in human genomic DNA, PhD thesis, Department of Mathematics, Stanford University, 1997
  • 4
    • 84974658259 scopus 로고    scopus 로고
    • Computational complexity of problems on probabilistic grammars and transducers
    • ICGI 2000: Grammatical Inference: Algorithms and Applications, Springer
    • Casacuberta F., and de la Higuera C. Computational complexity of problems on probabilistic grammars and transducers. ICGI 2000: Grammatical Inference: Algorithms and Applications. Lecture Notes in Comput. Sci. vol. 1891 (2000), Springer 15-24
    • (2000) Lecture Notes in Comput. Sci. , vol.1891 , pp. 15-24
    • Casacuberta, F.1    de la Higuera, C.2
  • 5
    • 13244260785 scopus 로고    scopus 로고
    • Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
    • Dowell R.D., and Eddy S.R. Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinformatics 5 (2004) 71
    • (2004) BMC Bioinformatics , vol.5 , pp. 71
    • Dowell, R.D.1    Eddy, S.R.2
  • 7
    • 0028272315 scopus 로고
    • RNA sequence analysis using covariance models
    • Eddy S.R., and Durbin R. RNA sequence analysis using covariance models. Nucleic Acids Res. 22 11 (1994) 2079-2088
    • (1994) Nucleic Acids Res. , vol.22 , Issue.11 , pp. 2079-2088
    • Eddy, S.R.1    Durbin, R.2
  • 8
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein D. Finding the k shortest paths. SIAM J. Comput. 28 2 (1998) 652-673
    • (1998) SIAM J. Comput. , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 9
    • 0015600423 scopus 로고
    • The Viterbi algorithm
    • Forney G.D. The Viterbi algorithm. Proc. IEEE 61 (1973) 268-278
    • (1973) Proc. IEEE , vol.61 , pp. 268-278
    • Forney, G.D.1
  • 10
    • 0033290515 scopus 로고    scopus 로고
    • C. Iseli, C.V. Jongeneel, P. Bucher, ESTScan: A program for detecting, evaluating, and reconstructing potential coding regions in EST sequences, in: ISMB 1999: Seventh International Conference on Intelligent Systems for Molecular Biology, 1999, pp. 138-148
  • 11
    • 18844398069 scopus 로고    scopus 로고
    • Capacity and complexity of HMM duration modeling techniques
    • Johnson M.T. Capacity and complexity of HMM duration modeling techniques. IEEE Signal Process. Lett. 12 5 (2005) 407-410
    • (2005) IEEE Signal Process. Lett. , vol.12 , Issue.5 , pp. 407-410
    • Johnson, M.T.1
  • 12
    • 0043123155 scopus 로고    scopus 로고
    • Pfold: RNA secondary structure prediction using stochastic context-free grammars
    • Knudsen B., and Hein J. Pfold: RNA secondary structure prediction using stochastic context-free grammars. Nucleic Acids Res. 31 13 (2003) 3423-3428
    • (2003) Nucleic Acids Res. , vol.31 , Issue.13 , pp. 3423-3428
    • Knudsen, B.1    Hein, J.2
  • 13
    • 0030623944 scopus 로고    scopus 로고
    • A. Krogh, Two methods for improving performance of an HMM and their application for gene finding, in: ISMB 1997: Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, 1997, pp. 179-186
  • 14
    • 0035910270 scopus 로고    scopus 로고
    • Predicting transmembrane protein topology with a hidden Markov model: Application to complete genomes
    • Krogh A., Larsson B., von Heijne G., and Sonnhammer E.L. Predicting transmembrane protein topology with a hidden Markov model: Application to complete genomes. J. Mol. Biol. 305 3 (2001) 567-570
    • (2001) J. Mol. Biol. , vol.305 , Issue.3 , pp. 567-570
    • Krogh, A.1    Larsson, B.2    von Heijne, G.3    Sonnhammer, E.L.4
  • 15
    • 21644467641 scopus 로고    scopus 로고
    • The consensus string problem and the complexity of comparing hidden Markov models
    • Lyngsø R.B., and Pedersen C.N.S. The consensus string problem and the complexity of comparing hidden Markov models. J. Comput. System Sci. 65 3 (2002) 545-569
    • (2002) J. Comput. System Sci. , vol.65 , Issue.3 , pp. 545-569
    • Lyngsø, R.B.1    Pedersen, C.N.S.2
  • 16
    • 4243671284 scopus 로고    scopus 로고
    • A sequence-profile-based HMM for predicting and discriminating beta barrel membrane proteins
    • Martelli P.L., Fariselli P., Krogh A., and Casadio R. A sequence-profile-based HMM for predicting and discriminating beta barrel membrane proteins. Bioinformatics 18 S1 (2002) S46-S53
    • (2002) Bioinformatics , vol.18 , Issue.SUPPL.1
    • Martelli, P.L.1    Fariselli, P.2    Krogh, A.3    Casadio, R.4
  • 17
    • 0024610919 scopus 로고
    • A tutorial on hidden Markov models and selected applications in speech recognition
    • Rabiner L.R. A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77 2 (1989) 257-285
    • (1989) Proc. IEEE , vol.77 , Issue.2 , pp. 257-285
    • Rabiner, L.R.1
  • 18
    • 25444447335 scopus 로고    scopus 로고
    • Effective ambiguity checking in biosequence analysis
    • Reeder J., Steffen P., and Giegerich R. Effective ambiguity checking in biosequence analysis. BMC Bioinformatics 6 (2005) 153
    • (2005) BMC Bioinformatics , vol.6 , pp. 153
    • Reeder, J.1    Steffen, P.2    Giegerich, R.3
  • 19
    • 0025627406 scopus 로고    scopus 로고
    • R. Schwartz, Y.-L. Chow, The N-best algorithms: An efficient and exact procedure for finding the N most likely sentence hypotheses, in: ICASSP: Acoustics, Speech, and Signal Processing., vol. 1, 1990, pp. 81-84
  • 20
    • 2942527473 scopus 로고    scopus 로고
    • Gene prediction with a hidden Markov model and a new intron submodel
    • Stanke M., and Waack S. Gene prediction with a hidden Markov model and a new intron submodel. Bioinformatics 19 S2 (2003) II215-II225
    • (2003) Bioinformatics , vol.19 , Issue.SUPPL.2
    • Stanke, M.1    Waack, S.2
  • 21
    • 34547107928 scopus 로고    scopus 로고
    • T. Vinař, Enhancements to hidden Markov models for gene finding and other biological applications, PhD thesis, University of Waterloo, 2005


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.