PubMed · 12798042
Hidden Markov models and optimized sequence alignments.
Abstract
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 and the alignment and scoring of homologous proteins.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
L Smith, L Yeganova, W J Wilbur. 2003. Hidden Markov models and optimized sequence alignments.. https://doi.org/10.1016/s1476-9271(02)00096-8
Cite the original work for its findings. Save a collection to share your selection of sources.