自由序列分析
序列(生物学)
史密斯-沃特曼算法
计算机科学
相似性(几何)
多序列比对
度量(数据仓库)
灵活性(工程)
数据挖掘
序列比对
相似
计算生物学
算法
人工智能
数学
基因
遗传学
生物
统计
肽序列
图像(数学)
作者
Stephen F. Altschul,Warren Gish,Webb Miller,Eugene W. Myers,David J. Lipman
标识
DOI:10.1016/s0022-2836(05)80360-2
摘要
A new approach to rapid sequence comparison, basic local alignment search tool (BLAST), directly approximates alignments that optimize a measure of local similarity, the maximal segment pair (MSP) score. Recent mathematical results on the stochastic properties of MSP scores allow an analysis of the performance of this method as well as the statistical significance 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI