Hidden Markov models and optimized seque
โ
L. Smith; L. Yeganova; W.J. Wilbur
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 179 KB
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