| Literature DB >> 12798042 |
L Smith1, L Yeganova, W J Wilbur.
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.Mesh：
Year: 2003 PMID： 12798042 DOI： 10.1016/s1476-9271(02)00096-8
Source DB: PubMed Journal: Comput Biol Chem ISSN： 1476-9271 Impact factor: 2.877