Rapid and sensitive protein similarity searches.
An algorithm was developed which facilitates the search for similarities between newly determined amino acid sequences and sequences already available in databases. Because of the algorithm's efficiency on many microcomputers, sensitive protein database searches may now become a routine procedure for molecular biologists. The method efficiently identifies regions of similar sequence and then scores the aligned identical and differing residues in those regions by means of an amino acid replacability matrix. This matrix increases sensitivity by giving high scores to those amino acid replacements which occur frequently in evolution. The algorithm has been implemented in a computer program designed to search protein databases very rapidly. For example, comparison of a 200-amino-acid sequence to the 500,000 residues in the National Biomedical Research Foundation library would take less than 2 minutes on a minicomputer, and less than 10 minutes on a microcomputer (IBM PC).
Lipman
D J
DJ
Pearson
W R
WR
D000595:Amino Acid Sequence; D000808:Angiotensinogen; D000818:Animals; D005075:Biological Evolution; D002043:Bunyaviridae; D002417:Cattle; D003201:Computers; D000242:Cyclic AMP / Q000494:pharmacology; D003574:Cytochrome c Group; D006801:Humans; D007256:Information Systems; D008838:Microcomputers; D009698:Nucleoproteins; D011336:Probability; D011494:Protein Kinases; D011498:Protein Precursors; D011506:Proteins; D051381:Rats; D012984:Software; D014764:Viral Proteins
D003574:Cytochrome c Group; D009698:Nucleoproteins; D011498:Protein Precursors; D011506:Proteins; D014764:Viral Proteins; D000808:Angiotensinogen; D000242:Cyclic AMP; D011494:Protein Kinases