A Sufficient Condition for Reducing Recursions in Hidden Markov Models
In hidden Markov models, the probability of observing a set of strings can be computed using recursion relations. We construct a sufficient condition for simplifying the recursion relations for a certain class of hidden Markov models. If the condition is satisfied, then one can construct a reduced recursion where the dependence on Markov states completely disappears. We discuss a specific example—namely, statistical multiple alignment based on the TKF-model—in which the sufficient condition is satisfied.
KeywordSHidden Markov model Recursions Reduction Markov states Statistical alignment
Unable to display preview. Download preview PDF.
- Hein, J., 2001. An algorithm for statistical alignment of sequences related by a binary tree. In: Altman, R.B., Dunker, A.K., Hunter, L., Lauderdale, K., Klein, T.E. (Eds.), Proceedings of the Pacific Symposium on Biocomputing, World Scientific, Singapore, pp. 179–190.Google Scholar