References

Altschul, 1991

Altschul, S. F. (1991).
Amino acid substitution matrices from an information theoretic perspective.
J. Mol. Biol. 219, 555-565.

Barrett et al., 1997

Barrett, C., Hughey, R., & Karplus, K. (1997).
Scoring hidden Markov models.
CABIOS, 13 (2), 191-199.

Bucher & Bairoch, 1994

Bucher, P. & Bairoch, A. (1994).
A generalized profile syntax for biomolecular sequence motifs and its function in automatic sequence interpretation.
In: Proc. Int. Conf. Intelligent Systems for Molecular Biology, (Altman, R. et al., eds) pp. 53-61, Menlo Park, CA: AAAI/MIT Press.

Eddy, 1996

Eddy, S. (1996).
Hidden Markov models.
Current Opinion in Structural Biology, 6 (3), 361-365.

Eddy et al., 1995

Eddy, S., Mitchison, G., & Durbin, R. (1995).
Maximum discrimination hidden Markov models of sequence consensus.
J. Comput. Biol. 2, 9-23.

Gotoh, 1982

Gotoh, O. (1982).
An improved algorithm for matching biological sequences.
J. Mol. Biol. 162 (3), 705-708.

Gribskov et al., 1990

Gribskov, M., Lüthy, R., & Eisenberg, D. (1990).
Profile analysis.
Methods in Enzymology, 183, 146-159.

Grice et al., 1997

Grice, J. A., Hughey, R., & Speck, D. (1997).
Reduced space sequence alignment.
CABIOS, 13 (1), 45-53.

Hennessy & Patterson, 1996

Hennessy, J. L. & Patterson, D. A. (1996).
Computer Architecture: A Quantitative Approach.
Los Altos, CA: Morgan Kaufmann Publishers.

Hirschberg, 1975

Hirschberg, D. S. (1975).
A linear space algorithm for computing maximal common subsequences.
Communications of the ACM, 18 (6), 341-343.

Huang, 1989

Huang, X. (1989).
A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor.
International Journal of Parallel Programming, 18 (3), 223-239.

Hughey, 1996

Hughey, R. (1996).
Parallel sequence comparison and alignment.
CABIOS, 12 (6), 473-479.

Hughey & Krogh, 1996

Hughey, R. & Krogh, A. (1996).
Hidden Markov models for sequence analysis: Extension and analysis of the basic method.
CABIOS, 12 (2), 95-107.

Krogh et al., 1994

Krogh, A., Brown, M., Mian, I. S., Sjölander, K., & Haussler, D. (1994).
Hidden Markov models in computational biology: Applications to protein modeling.
J. Mol. Biol. 235, 1501-1531.

Myers & Miller, 1988

Myers, E. W. & Miller, W. (1988).
Optimal alignments in linear space.
CABIOS, 4 (1), 11-17.

Needleman & Wunsch, 1970

Needleman, S. B. & 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-453.

Rabiner, 1989

Rabiner, L. R. (1989).
A tutorial on hidden Markov models and selected applications in speech recognition.
Proc. IEEE, 77 (2), 257-286.

Sellers, 1974

Sellers, P. H. (1974).
On the theory and computation of evolutionary distances.
SIAM J. Appl. Math. 26, 787-793.

Sjölander et al., 1996

Sjölander, K., Karplus, K., Brown, M. P., Hughey, R., Krogh, A., Mian, I. S., & Haussler, D. (1996).
Dirichlet mixtures: A method for improving detection of weak but significant protein sequence homology.
CABIOS, 12 (4), 327-345.

Smith & Waterman, 1981

Smith, T. F. & Waterman, M. S. (1981).
Identification of common molecular subsequences.
J. Mol. Biol. 147, 195-197.

Wagner & Fischer, 1974

Wagner, R. A. & Fischer, M. J. (1974).
The string-to-string correction problem.
J. ACM, 21 (1), 168-173.