MULTIPLE SEQUENCE ALIGNMENT WITH HIERARCHICAL-CLUSTERING
MULTIPLE SEQUENCE ALIGNMENT WITH HIERARCHICAL-CLUSTERING
复制标题
DOI：
10.1093/nar/16.22.10881
复制
发表时间：
1988-11-25
影响因子：
14.9
通讯作者：
CORPET, F
中科院分区：
文献类型：
--
作者：
CORPET, F
提出了一种在微机上既准确又易于使用的蛋白质或核酸序列多重比对算法。该方法基于传统的两两对齐动态规划方法。最初，使用成对对齐分数矩阵执行序列的分层聚类。最接近的序列被对齐，创建对齐序列组。然后对接近的组进行对齐，直到所有序列在一组中对齐。包含在多重对齐中的成对对齐形成一个用于产生分层聚类的新矩阵。如果它与第一个不同，则可以执行流程的迭代。以细胞色素c的39个序列的全局比对为例说明了该方法的可行性。
An algorithm is presented for the multiple alignment of sequences, either proteins or nucleic acids, that is both accurate and easy to use on microcomputers. The approach is based on the conventional dynamic-programming method of pairwise alignment. Initially, a hierarchical clustering of the sequences is performed using the matrix of the pairwise alignment scores. The closest sequences are aligned creating groups of aligned sequences. Then close groups are aligned until all sequences are aligned in one group. The pairwise alignments included in the multiple alignment form a new matrix that is used to produce a hierarchical clustering. If it is different from the first one, iteration of the process can be performed. The method is illustrated by an example: a global alignment of 39 sequences of cytochrome c.