Dynamic graphical models and nonhomogeneous hidden Markov models
β Scribed by Beatriz Lacruz; Pilar Lasala; Alberto Lekuona
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 153 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
β¦ Synopsis
We propose a dynamic graphical model which generalizes nonhomogeneous hidden Markov models. Inference and forecast procedures are developed. A comparison with an exact propagation algorithm is established and equivalence is stated.
π SIMILAR VOLUMES
We present a formulation of the Needleman-Wunsch type algorithm for sequence alignment in which the mutation matrix is allowed to vary under the control of a hidden Markov process. The fully trainable model is applied to two problems in bioinformatics: the recognition of related gene/protein names a
We discuss how methods based on hidden Markov models performed in the fold-recognition section of the CASP2 experiment. Hidden Markov models were built for a representative set of just over 1,000 structures from the Protein Data Bank (PDB). Each CASP2 target sequence was scored against this library