RAPID AND SENSITIVE PROTEIN SIMILARITY SEARCHES
RAPID AND SENSITIVE PROTEIN SIMILARITY SEARCHES
复制标题
DOI：
10.1126/science.2983426
复制
发表时间：
1985-01-01
期刊：
影响因子：
56.9
通讯作者：
PEARSON, WR
中科院分区：
文献类型：
--
作者：
LIPMAN, DJ;PEARSON, WR
开发了一种算法，该算法便于搜索新确定的氨基酸序列与数据库中已有的序列之间的相似性。由于该算法在许多微型计算机上的效率，敏感的蛋白质数据库搜索现在可能成为分子生物学家的例行程序。该方法有效地识别相似序列的区域，然后通过氨基酸可替换性矩阵对这些区域中比对的相同和不同残基进行评分。这种矩阵通过对进化中频繁出现的氨基酸替换给予高分来提高敏感性。该算法已在一个计算机程序中实现，该程序旨在非常快速地搜索蛋白质数据库。例如，将200个氨基酸的序列与国家生物医学研究基金会文库中的500,000个残基进行比较，在小型计算机上不到2分钟，在微型计算机(IBM PC)上不到10分钟。
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 replaceability 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).