Handbook of Hidden Markov models in bioinformatics

Handbook of Hidden Markov Models in Bioinformatics

Volumn , Issue , 2008, Pages 1-157

  Gollery, Martin ^a  

^a Tahoe Informatics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 74449090495     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420011807     Document Type: Book

References (155)

1. D. Bouchaffra and J. Tan, “Protein Fold Recognition using a Structural Hidden Markov Model,” Pattern Recognition, ICPR, Volume 3, 20-24 Aug. 2006, pp. 186–189.
2. A. Krogh et al., “Predicting Transmembrane Protein Topology with a Hidden Markov Model: Application to Complete Genomes,” J. Mol. Biol., 305, 567–80 (2001).
3. E. Sonnhammer, G. Heijne, and A. Krogh, “A Hidden Markov Model for Predicting Transmembrane Helices in Protein Sequences,” Proceedings of the Sixth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, 1998, pp. 175–82.
4. G. Tusnady and I. Simon, “Principles Governing Amino Acid Composition of Integral Membrane Proteins: Application to Topology Predic-tion,” J. Mol. Biol., 283, 489–506 (1998).
5. G. Tusnady and I. Simon, “The HMMTOP Transmembrane Topology Prediction Server,” Bioinformatics, 17, 849–50 (2001).
6. K. Meln, A. Krogh, and G. von Heijne, “Reliability Measures for Membrane Protein Topology Prediction Algorithms,” J. Mol. Biol., 327, 735– 44 (2003).
7. J. Zhu, J. Liu, and C. Lawrence, “Bayesian Adaptive Sequence Alignment Algorithms,” Bioinformatics 14, 25–39 (1998).
8. I. Holmes and R. Durbin, “Dynamic Programming Alignment Accura-cy,” J. Comput. Biol. 5, 493–504 (1998).
9. P. Lio, J. L. Thorne, N. Goldman, and D. T. Jones, “Passml: Combining Evolutionary Inference and Protein Secondary Structure Prediction,” Bioinformatics 14, 726–733 (1999).
10. E. Rivas and S. Eddy, “A Dynamic Programming Algorithm for RNA Structure Prediction Including Pseudoknots,” J. Mol. Biol. 285, 2053– 2068 (1999).
11. C. Burge and S. Karlin, “Prediction of Complete Gene Structures in Human Genomic DNA,” J. Mol. Biol. 268, 78–94 (1997).
12. D. Kulp, D. Haussler, M. G. Reese, and F. H. Eeckman, “A Generalized Hidden Markov Model for the Recognition of Human Genes in DNA,” Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, 1996, pp. 134–142.
13. A. Krogh, “Two Methods for Improving Performance of a HMM and Their Application for Gene Finding,” Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology, T. Gaasterland, P. Karp, K. Karplus, C. Ouzounis, C. Sander, and A. Valencia, Eds., AAAI Press, Menlo Park, CA, 1997, pp. 179–186.
14. E. Birney and R. Durbin, “Dynamite: A Flexible Code Generating Language for Dynamic Programming Methods Used in Sequence Compar-ison,” Proceedings of the Fifth International Conference on Intelligent Systems for Molecular Biology, T. Gaasterland, P. Karp, K. Karplus, C. Ouzounis, C. Sander, and A. Valencia, Eds., AAAI Press, Menlo Park, CA, 1997, pp. 56–64.
15. E. Birney, “Sequence Alignment in bioinformatics,” Ph.D. thesis, The Sanger Centre, Cambridge, U.K., 2000; available from http:// sanger.ac.uk/pub/birney/thesis/.
16. A. Krogh, M. Brown, I. S. Mian, K. Sjlander, and D. Haussler, “Hid-den Markov Models in Computational Biology: Applications to Protein Modeling,” J. Mol. Biol. 235, 1501–1531 (1994).
17. S. R. Eddy, “HMMER: A Profile Hidden Markov Modelling Package,” available from
18. http://hmmer.wustl.edu/.
19. A. Bateman, E. Birney, R. Durbin, S. R. Eddy, K. L. Howe, and E. L. L. Sonnhammer, “The Pfam Protein Families Database,” Nucleic Acids Res. 28, 263–266 (2000).
20. J. Schultz, R. R. Copley, T. Doerks, C. P. Ponting, and P. Bork, “S-MART: A Web-Based Tool for the Study of Genetically Mobile Do-mains,” Nucleic Acids Res. 28, 231–234 (2000).
21. K. Sjlander, K. Karplus, M. Brown, R. Hughey, A. Krogh, I. S. Mian, and D. Haussler, “Dirichlet Mixtures: A Method for Improved Detection of Weak but Significant Protein Sequence Homology,” Comput. Appl. Biosci. 12, 327–345 (1996).
22. S. R. Eddy, G. J. Mitchison, and R. Durbin, “Maximum Discrimination Hidden Markov Models of Sequence Consensus,” J. Comput. Biol. 2, 9–23 (1995).
23. T. Jaakkola, M. Diekhans, and D. Haussler, “A Discriminative Framework for Detecting Remote Protein Homologies,” Comput. Biol. 7, 95– 114 (2000).
24. S. Altschul, T. Madden, A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman, “Gapped BLAST and PSI-BLAST: A New Generation of Protein Database Search Programs,” Nucleic Acids Res. 25(17), 3389– 402 (1997).
25. S. Altschul, “Amino Acid Substitution Matrices from an Information Theoretic Perspective,” J. Mol. Biol. 219, 555–65 (1991).
26. S. Altschul, “A Protein Alignment Scoring System Sensitive at All Evolutionary Distances,” J. Mol. Evol. 36, 290–300 (1993).
27. S. Altschul, M. Boguski, W. Gish, and J. Wootton, “Issues in Searching, Molecular Sequence Databases,” Nature Genetics. 6, 119–129 (1994).
28. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman, “Basic Local Alignment Search Tool,” J. Mol. Biol. 215, 403–10 (1990).
29. I. Korf, M. Yandell, and J. Bedell, BLAST: An Essential Guide to the Basic Local Alignment Search Tool, O’Reilly Media Inc., Sebastopol, CA, 2003.
30. J. Claverie and D. States “Information Enhancement Methods for Large Scale Sequence Analysis,” Computers in Chemistry 17, 191–201 (1993).
31. E. Shpaer, M. Robinson, D. Yee, J. Candlin, R. Mines, and T. Hunkapiller, “Sensitivity and Selectivity in Protein Similarity Searches: Comparison of Smith-Waterman in Hardware,” Genomics 38, 179–191 (1996).
32. W. Gish and D. States, “Identification of Protein Coding Regions by Database Similarity Search,” Nature Genetics 3, 266–72 (1993).
33. S. Henikoff and J. Henikoff, “Amino Acid Substitution Matrices from Protein Blocks,” Proc. Natl. Acad. Sci. USA 89, 10915–19 (1992).
34. S. Karlin and S. Altschul, “Methods for Assessing the Statistical Significance of Molecular Sequence Features by Using General Scoring Schemes,” Proc. Natl. Acad. Sci. USA 87, 2264–68 (1990).
35. S. Karlin and S. Altschul, “Applications and Statistics for Multiple High-Scoring Segments in Molecular Sequences,” Proc. Natl. Acad. Sci. USA 90, 5873–7 (1993).
36. W. Pearson, “Searching Protein Sequence Libraries: Comparison of the Sensitivity and Selectivity of the Smith-Waterman and FASTA Algo-rithms,” Genomics 11(3), 635–50 (1991).
37. A. Schaffer, L. Aravind, T. Madden, S. Shavirin, J. Spouge, Y. Wolf, E. Koonin, and S. Altschul, “Improving the Accuracy of PSI-BLAST Protein Database Searches with Composition-Based Statistics and Other Refinements,” Nucleic Acids Research 29(14), 2994–3005 (2001).
38. D. States and W. Gish, “Combined Use of Sequence Similarity and Codon Bias for Coding Region Identification,” J. Comput. Biol. 1, 39-50 (1994).
39. D. States, W. Gish, and S. F. Altschul, “Improved Sensitivity of Nucleic Acid Database Similarity Searches Using Application Specific Scoring Matrices,” Methods: A Companion to Methods in Enzymology 3, 66–70 (1991).
40. J. Gouzy, F. Corpet, and D. Kahn, “Whole Genome Protein Domain Analysis Using a New Method for Domain Clustering,” Computers and Chemistry 23, 333–340 (1999).
41. I. Alam, S. Hubbard, S. Oliver, and M. Rattray, “A Kingdom-Specific Protein Domain HMM Library for Improved Annotation of Fungal Genomes,” BMC Genomics 8, 97 (2007).
42. D. Haft, B. Loftus, D. Richardson, F. Yang, J. Eisen, I. Paulsen, and O. White, “TIGRFAMs: a Protein Family Resource for the Functional Identification of Proteins,” Nucleic Acids Res. 29(1), 41–43 (2001).
43. A. Bateman, E. Birney, R. Durbin, S. Eddy, K. Howe, and E. Sonnhammer, “The Pfam Protein Families Database,” Nucleic Acids Res. 28(1), 263–266 (2000).
44. A. Bateman, E. Birney, L. Cerruti, R. Durbin, L. Etwiller, S. Eddy, S. Griffiths-Jones, K. Howe, M. Marshall, and E. Sonnhammer,“The Pfam Protein Families Database,” Nucleic Acids Res. 30(1), 276–280 (2002).
45. S. Pandit, D. Gosar, S. Abhiman, S. Sujatha, S. Dixit, N. Mhatre, R. Sowdhamini, and N. Srinivasan, “SUPfam—A Database of Potential Protein Superfamily Relationships Derived by Comparing Sequence-Based and Structure-Based Families: Implications for Structural Genomics and Function Annotation in Genomes,” Nucleic Acids Res. 30(1), 289–293 (2002).
46. M. Madera and J. Gough, “A Comparison of Profile Hidden Markov Model Procedures for Remote Homology Detection,” Nucleic Acids Res. 30(19), 4321–4328 (2002).
47. E. Sonnhammer, S. Eddy, E. Birney, A. Bateman, and R. Durbin, “Pfam: MSAs and HMM-Profiles of Protein Domains,” Nucleic Acids Res. 26(1), 320–322 (1998).
48. T. Doerks, R. Copley, J. Schultz, C. Ponting, and P. Bork, “Systematic Identification of Novel Protein Domain Families Associated with Nuclear Functions,” Genome Res. 12(1), 47–56 (2002).
49. M. Madera, C. Vogel, S. Kummerfeld, C. Chothia, and J. Gough, “The SUPERFAMILY database in 2004: Additions and Improvements,” Nucleic Acids Res. 32(database issue), D235–D239 (2004).
50. D. Wilson, M. Madera, C. Vogel, C. Chothia, and J. Gough, “The SUPERFAMILY Database in 2007: Families and Functions,” Nucleic Acids Res. 35(database issue), D308–D313 (2007).
51. J. Gough and C. Chothia, “SUPERFAMILY: HMMs Representing All Proteins of Known Structure. SCOP Sequence Searches, Alignments and Genome Assignments,” Nucleic Acids Res. 30(1), 268–272 (2002).
52. P. Papasaikas, P. Bagos, Z. Litou, V. Promponas, and S. Hamodrakas, “PRED-GPCR: GPCR Recognition and Family Classification Server,” Nucleic Acids Res. 32(web server issue), W380-W382 (2004).
53. N. Sgourakis, P. Bagos, P. Papasaikas, and S. Hamodrakas, “A Method for the Prediction of GPCRs Coupling Specificity to G-Proteins Using Refined Profile Hidden Markov Models,” BMC Bioinformatics 6, 104 (2005).
54. I. Alam, S. Hubbard, S. Oliver, and M. Rattray, “A Kingdom-Specific Protein Domain HMM Library for Improved Annotation of Fungal Genomes,” BMC Genomics 8, 97 (2007).
55. M. Gollery, D. Rector, and J. Lindelien, “TLFAM–a New Set of Protein Family Databases,” OMICS 6(1), 35–7 (2002).
56. C. Claudel-Renard, C. Chevalet, T. Faraut, and D. Kahn, “Enzyme-Specific Profiles for Genome Annotation: PRIAM,” Nucleic Acids Res. 31(22), 6633–6639 (2003).
57. J. Pinney, M. Shirley, G. McConkey, and D. Westhead, “MetaSHARK: Software for Automated Metabolic Network Prediction from DNA Sequence and Its Application to the Genomes of Plasmodium Falciparum and Eimeria tenella,” Nucleic Acids Res. 33(4), 1399–1409 (2005).
58. C. Hyland, J. Pinney, G. McConkey, and D. Westhead,“metaSHARK: a WWW Platform for Interactive Exploration of Metabolic Networks,” Nucleic Acids Res. 34(web server issue), W725–W728 (2006).
59. J. Schultz, F. Milpetz, P. Bork, C.P. Ponting, “SMART, a Simple Modular Architecture Research Tool: Identification of Signaling Domains,” Proc. Natl. Acad. Sci. USA 95(11), 5857–5864 (1998).
60. P. Thomas, A. Kejariwal, M. Campbell, H. Mi, K. Diemer, N. Guo, I. Ladunga, B. Ulitsky-Lazareva, A. Muruganujan, S. Rabkin, J. Van-dergriff, and O. Doremieux, “PANTHER: a Browsable Database of Gene Products Organized by Biological Function, Using Curated Protein Family and Subfamily Classification,” Nucleic Acids Res. 31(1), 334–341 (2003).
61. A. Marchler-Bauer, J. Anderson, M. Derbyshire, C. DeWeese-Scott, N. Gonzales, M. Gwadz, L. Hao, S. He, D. Hurwitz, J. Jackson, Z. Ke, D. Krylov, C. Lanczycki, C. Liebert, C. Liu, F. Lu, S. Lu, G. Marchler, M. Mullokandov, J. Song, N. Thanki, R. Yamashita, J. Yin, D. Zhang, and S. Bryant, “CDD: a Conserved Domain Database for Interactive Domain Family Analysis,” Nucleic Acids Res. 35(database issue), D237–D240 (2007).
62. A. Marchler-Bauer, A. Panchenko, B. Shoemaker, P. Thiessen, L. Geer, and S. Bryant, “CDD: a Database of Conserved Domain Alignments with Links to Domain Three-Dimensional structure,” Nucleic Acids Res. 30(1), 281–283 (2002).
63. A. Marchler-Bauer, J. Anderson, M. Derbyshire, C. DeWeese-Scott, N. Gonzales, M. Gwadz, L. Hao, S. He, D. Hurwitz, J. Jackson, Z. Ke, D. Krylov, C. Lanczycki, C. Liebert, C. Liu, F. Lu, S. Lu, G. Marchler, M. Mullokandov, J. Song, N. Thanki, R. Yamashita, J. Yin, D. Zhang, and S. Bryant, “CDD: a Conserved Domain Database for Protein Classifica-tion,” Nucleic Acids Res. 33(database issue), D192–D196 (2005).
64. A. Marchler-Bauer, J. Anderson, M. Derbyshire, C. DeWeese-Scott, N. Gonzales, M. Gwadz, L. Hao, S. He, D. Hurwitz, J. Jackson, Z. Ke, D. Krylov, C. Lanczycki, C. Liebert, C. Liu, F. Lu, S. Lu, G. Marchler, M. Mullokandov, J. Song, N. Thanki, R. Yamashita, J. Yin, D. Zhang, and S. Bryant, “CDD: a Curated Entrez Database of Conserved Domain Alignments,” Nucleic Acids Res. 31(1), 383–387 (2003).
65. R. Tatusov, N. Fedorova, J. Jackson, A. Jacobs, B. Kiryutin, E. Koonin, D. Krylov, R. Mazumder, S. Mekhedov, A. Nikolskaya, B. Rao, S. Smirnov, A. Sverdlov, S. Vasudevan, Y. Wolf, J. Yin, and D. Natale, “The COG Database: an Updated Version Includes Eukaryotes,” BMC Bioinformatics 4, 41 (2003).
66. R. Tatusov, D. Natale, I. Garkavtsev, T. Tatusova, U. Shankavaram, B. Rao, B. Kiryutin, M. Galperin, N. Fedorova, and E. Koonin, “The COG Database: New Developments in Phylogenetic Classification of Proteins from Complete Genomes,” Nucleic Acids Res. 29(1), 22–28 (2001).
67. R. Tatusov, M. Galperin, D. Natale, and E. Koonink, “The COG Database: a Tool for Genome-Scale Analysis of Protein Functions and Evolution,” Nucleic Acids Res. 28(1), 33–36 (2000).
68. J. Wasmuth and M. Blaxter, “prot4EST: Translating Expressed Sequence Tags from Neglected Genomes,” BMC Bioinformatics 5, 187 (2004).
69. C. Liang, F. Sun, H. Wang, J. Qu, R. Freeman, L. Pratt, and M-M Cordonnier-Pratt, “MAGIC-SPP: a Database-Driven DNA Sequence Processing Package with Associated Management Tools,” BMC Bioinformatics 7, 115 (2006).
70. P. Shafer, D. Lin, and G. Yona, “EST2Prot: Mapping EST Sequences to Proteins,” BMC Genomics 7, 41 (2006).
71. Y. Strahm, D. Powell, and C. Lefvre, “EST-PAC a Web Package for EST Annotation and Protein Sequence Prediction,” Source Code Biol Med. 1, 2 (2006).
72. J. Peregrn-Alvarez, A. Yam, G. Sivakumar, and J. Parkinson, “PartiGeneDB—Collating Partial Genomes,” Nucleic Acids Res. 1, 33(database issue), D303–D307 (2005).
73. D. Field, B. Tiwari, and J. Snape, “Bioinformatics and Data Management Support for Environmental Genomics,” PLoS Biol. 3(8), e297 (2005).
74. M. Latorre, H. Silva, J. Saba, C. Guziolowski, P. Vizoso, V. Martinez, J. Maldonado, A. Morales, R. Caroca, V. Cambiazo, R. Campos-Vargas, M. Gonzalez, A. Orellana, J. Retamales, and L. Meisel, “JUICE: a Data Management System that Facilitates the Analysis of Large Volumes of Information in an EST Project Workflow,” BMC Bioinformatics 7, 513 (2006).
75. M-M Cordonnier-Pratt, C. Liang, H. Wang, D. Kolychev, F. Sun, R. Freeman, R. Sullivan, and L. Pratt, “MAGIC Database and Interfaces: an Integrated Package for Gene Discovery and Expression,” Comp. Funct. Genom. 5, 268–275 (2004).
76. F. Tang, C. Chua, L. Ho, Y. Lim, P. Issac, and A. Krishnan A.“Wildfire: Distributed, Grid-Enabled Workflow Construction and Execution,” BMC Bioinformatics 6, 69 (2005).
77. P. Romano, D. Marra, and L. Milanesi, “Web Services and Workflow Management for Biological Resources,” BMC Bioinformatics 6(Suppl 4), S24 (2005).
78. E. Quevillon, V. Silventoinen, S. Pillai, N. Harte, N. Mulder, R. Apweiler, and R. Lopez, “InterProScan: Protein Domains Identifi-er,” Nucleic Acids Res. 33(web server issue): W116–W120 (2005).
79. N. Mulder et. al, “New developments in the InterPro Database,” Nucleic Acids Res. 35(Database issue):D224–8 (2007).
80. E. Zdobnov and R. Apweiler, “InterProScan–an Integration Platform for the Signature-Recognition methods in InterPro,” Bioinformatics 17(9), 847–8 (2001).
81. S. Casillas and A. Barbadilla, “PDA: a Pipeline to Explore and Estimate Polymorphism in Large DNA Databases,” Nucleic Acids Res. 32(web server issue), W166–W169 (2004).
82. S. Casillas and A. Barbadilla, “PDA v.2: Improving the Exploration and Estimation of Nucleotide Polymorphism in Large Datasets of Heterogeneous DNA,” Nucleic Acids Res. 34(web server issue), W632–W634 (2006).
83. L. Qiao, J. Zhu, Q. Liu, T. Zhu, C. Song, W. Lin, G. Wei, L. Mu, J. Tao, N. Zhao, G. Yang, and X. Liu, “BOD: a Customizable Bioinformatics on Demand System Accommodating Multiple Steps and Parallel Tasks,” Nucleic Acids Res. 32(14), 4175–4181 (2004).
84. E. Kawas, M. Senger, and M. Wilkinson, “BioMoby Extensions to the Taverna Workflow Management and Enactment Software,” BMC Bioinformatics 7, 523 (2006).
85. M. Hassan, R. Brown, S. Varma-O’Brien, and D. Rogers, “Cheminfor-matics Analysis and Learning in a Data Pipelining Environment,” Mol. Divers 10(3), 283–99 (2006).
86. R. de Knikker, Y. Guo, J. Li, A. Kwan, K. Yip, D. Cheung, and K. Cheung, “A Web Services Choreography Scenario for Interoperating Bioinformatics Applications,” BMC Bioinformatics 5, 25 (2004).
87. A. Konagaya, “Trends in Life Science Grid: From Computing Grid to Knowledge Grid,” BMC Bioinformatics 7(Suppl 5), S10 (2006).
88. R. de Knikker, Y. Guo, J. Li, A. Kwan, K. Yip, D. Cheung, and K. Cheung, “A Web Services Choreography Scenario for Interoperating Bioinformatics Applications,” BMC Bioinformatics 5, 25 (2004).
89. A. Garcia Castro, S. Thoraval, L. Garcia, and M. Ragan, “Workflows in Bioinformatics: Meta-Analysis and Prototype Implementation of a Workflow Generator,” BMC Bioinformatics 6, 87 (2005).
90. D. Hull, K. Wolstencroft, R. Stevens, C. Goble, M. Pocock, P. Li, and T. Oinn, “Taverna: a Tool for Building and Running Workflows of Ser-vices,” Nucleic Acids Res. 34(web server issue), W729–W732 (2006).
91. E. Kawas, M. Senger, and M. Wilkinson, “BioMoby Extensions to the Taverna Workflow Management and Enactment Software,” BMC Bioinformatics 7, 523 (2006).
92. http://www.ncbi.nlm.nih.gov/sites/entrez?Db=PubMedCmd =ShowDetailViewTerr
93. M. Wistrand and E. Sonnhammer, “Improved Profile HMM Performance by Assessment of Critical Algorithmic Features in SAM and HMMER,” BMC Bioinformatics 6, 99 (2005).
94. M. Wistrand and E. Sonnhammer, “Transition Priors for Protein Hidden Markov Models: an Empirical Study Towards Maximum Discrimi-nation,” J. Comput. Biol. 11(1), 181–93 (2004).
95. R. Hughey and A. Krogh, “Hidden Markov Models for Sequence Analysis: Extension and Analysis of the Basic Method,” CABIOS 12(2), 95107 (1996).
96. K. Karplus, C. Barrett, and R. Hughey, “Hidden Markov Models for Detecting Remote Protein Homologies,” Bioinformatics 14(10), 846856 (1998).
97. A. Krogh, M. Brown, I. S. Mian, K. Sjolander, and D. Haussler, “Hid-den Markov Models in Computational Biology: Applications to Protein Modeling,” Journal of Molecular Biology 235:15011531 (1994).
98. K. Karplus, R. Karchin, C. Barrett, S. Tu, M. Cline, M. Diekhans, L. Grate, J. Casper, and R. Hughey, “What is the Value Added by Human Intervention in Protein Structure Prediction?” Proteins: Structure, Function, and Genetics (2001).
99. R. Wheeler and R. Hughey, “Optimizing Reduced Space Sequence Anal-ysis,” Bioinformatics 16(12), 10821090 (2000).
100. K. Karplus, C. Barrett, M. Cline, M. Diekhans, L. Grate, R. Hughey, “Predicting Protein Structure using Only Sequence Information,” Proteins: Structure, Function, and Genetics, Supplement 3, 121125 (1999).
101. J. Park, K. Karplus, C. Barrett, R. Hughey, D. Haussler, T. Hubbard, and C. Chothia, “Sequence Comparisons Using Multiple Sequences Detect Twice as many Remote Homologues as Pairwise Methods,” Journal of Molecular Biology 284(4), 12011210 (1998).
102. R. Karchin and R. Hughey, “Weighting Hidden Markov Models for Maximum Discrimination,” Bioinformatics 14(9), 772782 (1998).
103. C. Tarnas and R. Hughey, “Reduced Space Hidden Markov Model Train-ing,” Bioinformatics 14(5), 401406 (1998).
104. K. Karplus, K. Sjolander, C. Barrett, M. Cline, D. Haussler, R. Hughey, L. Holm, and C. Sander, “Predicting Protein Structure Using Hidden Markov Models,” Proteins: Structure, Function, and Genetics, Supplement 1 (1997).
105. K. Sjolander, K. Karplus, M. Brown, R. Hughey, A. Krogh, I. S. Mian, and D. Haussler, “Dirichlet Mixtures: A Method for Improving Detection of Weak but Signicant Protein Sequence Homology,” CABIOS 12(4), 327345 (1996).
106. C. Barrett, R. Hughey, and K. Karplus, “Scoring Hidden Markov Models,” CABIOS 13(2), 191–199 (1997).
107. J. A. Grice, R. Hughey, and D. Speck, “Reduced Space Sequence Align-ment,” CABIOS 13(1), 4553 (1997).
108. A. Krogh, I. S. Mian, and D. Haussler, “A Hidden Markov Model that finds Genes in E. coli,” Nucleic Acids Research (1994).
109. R. Hughey and A. Krogh, “SAM: Sequence Alignment and Modeling Software System,” Technical Report UCSC-CRL-96-22, University of California, Santa Cruz, CA, 1996.
110. K. Karplus, “Regularizers for Estimating Distributions of Amino Acids from Small Samples,” Technical Report UCSC-CRL-95-11, University of California, Santa Cruz, CA, 1995.
111. C.-M. Hsu, C.-Y. Chen, and B.-J. Liu, “MAGIIC-PRO: Detecting Functional Signatures by Efficient Discovery of Long Patterns in Protein Se-quences,” Nucleic Acids Res. 34(web server issue), W356–W361 (2006).
112. R. Gutman, C. Berezin, R. Wollman, Y. Rosenberg, and N. Ben-Tal, “QuasiMotiFinder: Protein Annotation by Searching for Evolutionarily Conserved Motif-Like Patterns,” Nucleic Acids Res. 33(suppl 2), W255– W261, (2005).
113. I. Jonassen, J.F. Collins and D. Higgins, “Finding Flexible Patterns in Unaligned Protein Sequences,” Protein Science 4(8), 1587–1595 (1995).
114. I. Jonassen, “Efficient Discovery of Conserved Patterns Using a Pattern Graph,” Comput. Appl. Biosci. 13(5), 509–522 (1997).
115. P. Puntervoll, R. Linding, C. Gemnd, S. Chabanis-Davidson, M. Mat-tingsdal, S. Cameron, D. Martin, G. Ausiello, B., Brannetti, A. Costan-tini, F. Ferr, V. Maselli, A. Via, G. Cesareni, F. Diella, G. Superti-Furga, L. Wyrwicz, C. Ramu, C. McGuigan, R. Gudavalli, I. Letunic, P. Bork, L. Rychlewski, B. Kster, M. Helmer-Citterich, W. Hunter, R. Aasland, and T. Gibson, “ELM Server: a New Resource for Investigating Short Functional Sites in Modular Eukaryotic Proteins,” Nucleic Acids Res. 31, 3625–3630 (2003).
116. J. Huang and D. Brutlag, “The eMOTIF Database,” Nucleic Acids Res. 29, 202–204 (2001).
117. J. Henikoff, E. Greene, S. Pietrokovski, and S. Henikoff, “Increased Coverage of Protein Families with the Blocks Database Servers,” Nucl. Acids Res. 28, 228–230 (2000).
118. C. Nevill-Manning, T. Wu, and D. Brutlag, “Highly Specific Protein Sequence Motifs for Genome Analysis,” Proc. Natl. Acad. Sci. USA 95, 5865–5871 (1998).
119. S. Henikoff, J.G. Henikoff, and S. Pietrokovski, “Blocks+: A Non-redundant Database of Protein Alignment Blocks Derived from Multiple Compilations,” Bioinformatics 15(6), 471–479 (1999).
120. E. de Castro, C. Sigrist, A. Gattiker, V. Bulliard, P. Langendijk-Genevaux, E. Gasteiger, A. Bairoch, and N. Hulo “ScanProsite: Detection of PROSITE Signature Matches and ProRule-Associated Functional and Structural Residues in Proteins,” Nucleic Acids Res. 34(web server issue), W362–W365 (2006).
121. G. Chukkapalli, C. Guda and S. Subramaniam, “SledgeHMMER, a Web Server for Batch Searching the Pfam Database,” Nucleic Acids Res. 32(web server issue), W542–W544 (2004).
122. J. Walters, B. Qudah, and V. Chaudhary, “Accelerating the hmmer Sequence Analysis Suite Using Conventional Processors,” (2006), Proceedings of the 20th International Conference on Advanced Information Networking and Applications Volume 1(AINA’06), pp. 289–294, Washington, D.C., IEEE Computer Society.
123. B. Wun, J. Buhler, and P. Crowley, “Exploiting Coarse Grained Parallelism to Accelerate Protein Motif Finding with a Network Processor,” 2005, PACT ’05: Proceedings of the 2005 International Conference on Parallel Architectures and Compilation Techniques.
124. J. Landman, J. Ray, and J. Walters, “Accelerating hmmer Searches on Opteron Processors with Minimally Invasive Recoding,” Proceedings of the 20th International Conference on Advanced Information Networking and Applications Volume 2 (AINA’06), pp. 628–636, Washington, D.C., IEEE Computer Society.
125. E. Lindahl, “Altivec Accelerated HMM Algorithms,” 2005. http://lindahl.sbc.su.se/.
126. D. Horn, M. Houston, and P. Hanrahan, “ClawHMMER: A Streaming HMMer-Search Implementation,” Supercomputing, 2005, Proceedings of the ACM/IEEE SC 2005 Conference, 12–18 Nov. 2005, pp. 11–11.
127. E. Birney, M. Clamp, and R. Durbin, “GeneWise and Genomewise,” Genome Res. 14(5), 988–995 (2004).
128. V. Curwen, E. Eyras, T. Andrews, L. Clarke, E. Mongin, S. Searle, and M. Clamp, “The Ensembl Automatic Gene Annotation System,” Genome Res. 14(5), 942–950 (2004).
129. Progeniq is the company that makes the BioBoost accelerator system. See their product line at www.progeniq.com.
130. TimeLogic makes the DeCypher line of accelerators that include accelerated HMM searches. See www.timelogic.com.
131. N. Dickens and C. Ponting, “THoR: a Tool for Domain Discovery and Curation of Multiple Alignments,” Genome Biol. 4(8), R52 (2003).
132. A. Henschel, C. Winter, W. Kim, and M. Schroeder, “Using Structural Motif Descriptors for Sequence-Based Binding Site Prediction,” BMC Bioinformatics. 8(Suppl 4), S5 (2007).
133. P. Srivastava, D. Desai, S. Nandi, and A. Lynn, “HMM-ModE— Improved Classification Using Profile Hidden Markov Models by Op-timising the Discrimination Threshold and Modifying Emission Probabilities with Negative Training Sequences,” BMC Bioinformatics 8,104 (2007).
134. A. Bateman and R. Finn, “SCOOP: a Simple Method for Identification of Novel Protein Superfamily Relationships,” Bioinformatics 23(7), 809– 814 (2007).
135. D. Haussler, “Computational Genefinding,” Trends Biochem. Sci. 12–15 (1998).
136. C. Burge and S. Karlin, “Finding the Genes in Genomic DNA,” Curr. Opin. Struct. Biol., 8, 346–354 (1998).
137. M. Burset and R. Guigo, “Evaluation of Gene Structure Prediction Pro-grams,” Genomics 34, 353–367 (1996).
138. S. Rogic, A. Mackworth, and F. Ouellette, “Evaluation of Gene-Finding Programs on Mammalian Sequences,” Genome Res. 11, 817–832 (2001).
139. S. Salzberg, A. Delcher, S. Kasif, and O. White, “Microbial Gene Identification Using Interpolated Markov Models,” Nucleic Acids Res. 26, 544–548 (1998).
140. A. Lukashin and M. Borodovsky, “GeneMark.hmm: New Solutions for Gene Finding,” Nucleic Acids Res. 26, 1107–1115 (1998).
141. J. Henderson, S. Salzberg, and K. Fasman, “Finding Genes in Human D-NA with a Hidden Markov Model,” J. Comput. Biol. 4, 127–141 (1997).
142. L. Pachter, M. Alexandersson, and S. Cawley, “Applications of Generalized Pair Hidden Markov Models to Alignment and Gene Finding Problems,” J. Comput. Biol. 9, 389–399 (2002).
143. A. Krogh, I. Mian, and D. Haussler, “A Hidden Markov Model that Finds Genes in E. coli DNA,” Nucleic Acids Res. 22, 4768–4778 (1994).
144. D. Kulp, D. Haussler, M. Reese, and F. Eeckman, “A Generalized Hidden Markov Model for the Recognition of Human Genes in DNA,” Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, pp. 134–142 (1996).
145. A. Krogh, “Two Methods for Improving Performace of a HMM and Their Application for Gene Finding,” The Fifth International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, pp. 179–186 (1997).
146. M. Borodovsky, J. McIninch, E. Koonin, K. Rudd, C. Mdigue, and A. Danchin, “Detection of New Genes in a Bacterial Genome Using Markov Models for Three Gene Classes,” Nucleic Acids Res. 23, 3554– 3562 (1995).
147. Z. Wang, Y. Chen, and Y. Li, “A Brief Review of Computational Gene Prediction Methods,” Genome Proteomics Bioinformatics 2, 216–221 (2004).
148. W. Majoros, M. Pertea, A. Delcher and S. Salzberg, “Efficient Decoding Algorithms for Generalized Hidden Markov Model Gene Finders,” BMC Bioinformatics 6, 16 (2005).
149. M. Stanke and S. Waack, “Gene Prediction with a Hidden Markov Model and a New Intron Submodel,” Bioinformatics 19, ii215–ii225 (2003).
150. W. Majoros, M. Pertea, and S. Salzberg, “TigrScan and GlimmerHMM: Two Open Source ab Initio Eukaryotic Gene-Finders,” Bioinformatics 20, 2878–2879 (2004).
151. I. Korf, “Gene Finding in Novel Genomes,” BMC Bioinformatics 5, 59 (2004).
152. K. Knapp, K. Chen, and Y. Phoebe, “An Evaluation of Contemporary Hidden Markov Model Genefinders with a Predicted Exon Taxonomy,” Nucleic Acids Res. 35(1), 317–324 (2007).
153. W. Majoros, M. Pertea, C. Antonescu, and S. Salzberg, “GlimmerM, Exonomy and Unveil: Three ab Initio Eukaryotic Genefinders,” Nucleic Acids Res. 31(13), 3601–3604 (2003).
154. T. Bailey and C. Elkan, “Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Biopolymers,” Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology AAAI Press, Menlo Park, CA, pp. 28–36 (1994).
155. T. Bailey and M. Gribskov, “Combining Evidence Using p-Values: Application to Sequence Homology Searches,” Bioinformatics 14, 48–54 (1998).