BASIC LOCAL ALIGNMENT SEARCH TOOL

BASIC LOCAL ALIGNMENT SEARCH TOOL
复制标题

DOI:
10.1006/jmbi.1990.9999
复制
发表时间:
1990-10-05
影响因子:
5.6
通讯作者:
LIPMAN, DJ
LIPMAN, DJ
中科院分区:
生物学2区
文献类型:
--
作者:
ALTSCHUL, SF;GISH, W;LIPMAN, DJ

文献摘要

被引文献

相似文献

一种快速序列比较的新方法,基本的局部校准搜索工具(BLAST)直接近似于优化局部相似性度量的捕食,即最大段对(MSP)分数。关于MSP分数随机特性的最新数学结果允许分析该方法的性能以及其产生的比对的统计意义。基本算法很简单又健壮。它可以通过多种方式实现,并在多种情况下应用,包括直线DNA和蛋白质序列数据库搜索,基序搜索,基因识别搜索以及在长DNA序列中相似性的多个区域的分析中。除了其灵活性和对数学分析的易处理性外,BLAST还比现有的序列比较工具快的速度更快。
A new approach to rapid sequence comparison, basic local alignment search tool (BLAST), directly approximates aligments that optimize a measure of local similarity, the maximal segment pair (MSP) scores. Recent mathematical results on the stochastic properties of MSP scores allow an analysis of the performance of this method as well as the statistical significnce of alignments it generates. The basic algorithm is simple and robust; it can be implemented in a number of ways and applied in a variety of contexts including straight-forward DNA and protein sequence database searches, motif searches, gene identification searches, and in the analysis of multiple regions of similarity in long DNA sequences. In addition to its flexibility and tractability to mathematical analysis, BLAST is an order of magnitude faster than existing sequence comparison tools of comparable sensitivity.