Reduced space hidden Markov model training

Bioinformatics

Volumn 14, Issue 5, 1998, Pages 401-406

  Tarnas, Christopher ^a   Hughey, Richard ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; GENETIC PROCEDURES; INTERNET; MATHEMATICAL MODEL; PRIORITY JOURNAL; PROBABILITY; SPACE; TRAINING;

EID: 0031824257     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/14.5.401     Document Type: Article

References (21)

1. Altschul, S.F. (1991) Amino acid substitution matrices from an information theoretic perspective. J. Mol. Biol., 219, 555-565.
2. Barrett, C., Hughey, R. and Karplus, K. (1997) Scoring hidden Markov models. Comput. Applic. Biosci., 13, 191-199.
3. Bucher, P. and Bairoch, A. (1994) A generalized profile syntax for biomolecular sequence motifs and its function in automatic sequence interpretation. In Altman, R. et al. (eds), Proceedings of the International Conference on Intelligent Systems for Molecular Biology. AAAI/MIT Press, Menlo Park, CA, pp. 53-61.
4. Eddy, S. (1996) Hidden Markov models. Curr. Opin. Struct. Biol., 6, 361-365.
5. Eddy, S., Mitchison, G. and Durbin, R. (1995) Maximum discrimination hidden Markov models of sequence consensus. J Comput. Biol., 2, 9-23.
6. Gotoh, O. (1982). An improved algorithm for matching biological sequences. J. Mol. Biol., 162, 705-708.
7. Gribskov, M., Lüthy, R. and Eisenberg, D. (1990) Profile analysis. Methods Enzymol., 183, 146-159.
8. Grice, J.A., Hughey, R. and Speck, D. (1997) Reduced space sequence alignment. Comput. Applic. Biosci., 13, 45-53.
9. Hennessy, J.L. and Patterson, D.A. (1996) Computer Architecture: A Quantitative Approach. Morgan Kaufmann, Los Altos, CA.
10. Hirschberg, D.S. (1975) A linear space algorithin for computing maximal common subsequences. Commun. ACM, 18, 341-343.
11. Huang, X. (1989) A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor. Int. J. Parallel Program., 18, 223-239.
12. Hughey, R. (1996) Parallel sequence comparison and alignment. Comput. Applic. Biosci., 12, 473-479.
13. Hughey, R. and Krogh, A. (1996) Hidden Markov models for sequence analysis: Extension and analysis of the basic method. Comput. Applic. Biosci., 12, 95-107.
14. Krogh, A., Brown, M., Mian, I.S., Sjölander, K. and Haussler, D. (1994) Hidden Markov models in computational biology: Applications to protein modeling. J. Mol. Biol., 235, 1501-1531.
15. Myers, E.W. and Miller, W. (1988) Optimal alignments in linear space. Comput Applic Biosci., 4, 11-17.
16. Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequences of two proteins. J Mol. Biol., 48, 443-153.
17. Rabiner, L.R. (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE, 77, 257-286.
18. Sellers, P.H. (1974) On the theory and computation of evolutionary distances. SIAM J. Appl Math., 26, 787-793.
19. Sjölander, K., Karplus, K., Brown, M.P., Hughey, R., Krogh, A., Mian, I.S. and Haussler, D. (1996) Dirichlet mixtures: A method for improving detection of weak but significant protein sequence homology. Comput. Applic. Biosci., 12, 327-345.
20. Smith, T.F. and Waterman, M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
21. Wagner, R.A. and Fischer, M.J. (1974) The string-to-string correction problem. J ACM, 21, 168-173.