PARAMETRIC SEQUENCE COMPARISONS

被引：66

作者：

WATERMAN, MS

EGGERT, M

LANDER, E

机构：

[1] WHITEHEAD INST BIOMED RES, CAMBRIDGE, MA 02142 USA

[2] UNIV SO CALIF, DEPT MOLEC BIOL, LOS ANGELES, CA 90089 USA

来源：

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 1992年 / 89卷 / 13期

关键词：

D O I：

10.1073/pnas.89.13.6090

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

Current algorithms can find optimal alignments of two nucleic acid or protein sequences, often by using dynamic programming. While the choice of algorithm penalty parameters greatly influences the quality of the resulting alignments, this choice has been done in an ad hoc manner. In this work, we present an algorithm to efficiently find the optimal alignments for all choices of the penalty parameters. It is then possible to systematically explore these alignments for those with the most biological or statistical interest. Several examples illustrate the method.

引用

页码：6090 / 6093

页数：4

共 18 条

[1]

ALTSCHUL SF, 1990, J MOL BIOL, V214, P1

[2] EVALUATION AND IMPROVEMENTS IN THE AUTOMATIC ALIGNMENT OF PROTEIN SEQUENCES [J].