Using guide trees to construct multiple-sequence evolutionary HMMs - PubMed (original) (raw)

Comparative Study

Using guide trees to construct multiple-sequence evolutionary HMMs

I Holmes. Bioinformatics. 2003.

Abstract

Motivation: Score-based progressive alignment algorithms do dynamic programming on successive branches of a guide tree. The analogous probabilistic construct is an Evolutionary HMM. This is a multiple-sequence hidden Markov model (HMM) made by combining transducers (conditionally normalised Pair HMMs) on the branches of a phylogenetic tree.

Methods: We present general algorithms for constructing an Evolutionary HMM from any Pair HMM and for doing dynamic programming to any Multiple-sequence HMM.

Results: Our prototype implementation, Handel, is based on the Thorne-Kishino-Felsenstein evolutionary model and is benchmarked using structural reference alignments.

PubMed Disclaimer

Publication types

MeSH terms

LinkOut - more resources

• Full Text Sources

  • Ovid Technologies, Inc.
  • Silverchair Information Systems