A general method applicable to the search for similarities in the amino acid sequence of two proteins

Saul B. Needleman, Chris Wunsch

Research output: Contribution to journalArticle

6686 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)443-453
Number of pages11
JournalJournal of Molecular Biology
Volume48
Issue number3
DOIs
StatePublished - Mar 28 1970
Externally publishedYes

Fingerprint

Amino Acid Sequence
Proteins
Amino Acids

ASJC Scopus subject areas

  • Virology

Cite this

A general method applicable to the search for similarities in the amino acid sequence of two proteins. / Needleman, Saul B.; Wunsch, Chris.

In: Journal of Molecular Biology, Vol. 48, No. 3, 28.03.1970, p. 443-453.

Research output: Contribution to journalArticle

@article{ea252fd3937a4a309a5e07e61e5531a7,
title = "A general method applicable to the search for similarities in the amino acid sequence of two proteins",
abstract = "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.",
author = "Needleman, {Saul B.} and Chris Wunsch",
year = "1970",
month = "3",
day = "28",
doi = "10.1016/0022-2836(70)90057-4",
language = "English",
volume = "48",
pages = "443--453",
journal = "Journal of Molecular Biology",
issn = "0022-2836",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - A general method applicable to the search for similarities in the amino acid sequence of two proteins

AU - Needleman, Saul B.

AU - Wunsch, Chris

PY - 1970/3/28

Y1 - 1970/3/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0014757386&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0014757386&partnerID=8YFLogxK

U2 - 10.1016/0022-2836(70)90057-4

DO - 10.1016/0022-2836(70)90057-4

M3 - Article

C2 - 5420325

AN - SCOPUS:0014757386

VL - 48

SP - 443

EP - 453

JO - Journal of Molecular Biology

JF - Journal of Molecular Biology

SN - 0022-2836

IS - 3

ER -