Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S1476-9271(02)00096-8 | Computational Biology and Chemistry |
Keywords | DocType | Volume |
Algorithm,Optimization,Gene synonyms,Sequence alignment | Journal | 27 |
Issue | ISSN | Citations |
1 | 1476-9271 | 2 |
PageRank | References | Authors |
0.44 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lawrence H. Smith | 1 | 196 | 14.48 |
| Lana Yeganova | 2 | 89 | 9.92 |
| W. John Wilbur | 3 | 430 | 45.66 |