A GENERAL METHOD APPLICABLE TO SEARCH FOR SIMILARITIES IN AMINO ACID SEQUENCE OF 2 PROTEINS
A GENERAL METHOD APPLICABLE TO SEARCH FOR SIMILARITIES IN AMINO ACID SEQUENCE OF 2 PROTEINS
复制标题
DOI：
10.1016/0022-2836(70)90057-4
复制
发表时间：
1970-01-01
影响因子：
5.6
通讯作者：
WUNSCH, CD
中科院分区：
文献类型：
--
作者：
NEEDLEMAN, SB;WUNSCH, CD
已经开发出一种适用于计算机的方法，用于查找两种蛋白质氨基酸序列的相似性。根据这些发现，可以确定蛋白质之间是否存在显着的同源性。该信息用于追踪它们可能的进化发展。最大匹配是取决于序列相似性的数字。它的定义之一是一种蛋白质可以与第二种蛋白质的氨基酸相匹配的最大氨基酸数量，允许任一序列中所有可能的中断。虽然中断会产生大量的比较，但该方法有效地排除了那些无法促成最大匹配的比较。比较是根据最小的显着性单位（一对氨基酸，每个蛋白质一个）进行的。所有可能的对都由二维数组表示，所有可能的比较由通过数组的路径表示。对于这种最大匹配，仅必须评估某些可能的路径。一个数值（在本例中为一个）被分配给数组中代表类似氨基酸的每个单元格。最大匹配是对每个路径的单元格值求和得到的最大数字。
A computer adaptable method for finding similarities in the amino acid sequences of two proteins has been developed. From these findings it is possible to determine whether significant homology exists between the proteins. This information is used to trace their possible evolutionary development.The maximum match is a number dependent upon the similarity of the sequences. One of its definitions is the largest number of amino acids of one protein that can be matched with those of a second protein allowing for all possible interruptions in either of the sequences. While the interruptions give rise to a very large number of comparisons, the method efficiently excludes from consideration those comparisons that cannot contribute to the maximum match.Comparisons are made from the smallest unit of significance, a pair of amino acids, one from each protein. All possible pairs are represented by a two-dimensional array, and all possible comparisons are represented by pathways through the array. For this maximum match only certain of the possible pathways must be evaluated. A numerical value, one in this case, is assigned to every cell in the array representing like amino acids. The maximum match is the largest number that would result from summing the cell values of every pathway.