Using the Basic Local Alignment Search Tool (BLAST).
Using the Basic Local Alignment Search Tool (BLAST).
复制标题
DOI：
10.1101/pdb.top17
复制
发表时间：
2007-07-01
期刊：
影响因子：
--
通讯作者：
Mount, David W
中科院分区：
文献类型：
--
作者：
Mount, David W
引言BLAST算法是一种通过比FASTA更快但同样敏感的算法进行DNA和蛋白质序列相似性搜索的方法。这两种方法都遵循一种启发式（尝试和真实）方法，该方法几乎总是在数据库搜索中找到相关序列，但不像动态规划算法那样具有最优解的基本保证。FASTA在查询和数据库序列中找到短的共同模式，并将这些模式连接到比对中。BLAST与FASTA相似，但通过只搜索核酸和蛋白质序列中更罕见、更重要的模式，速度进一步提高。BLAST是非常流行的，因为它在万维网上的可用性，通过一个大型服务器在国家生物技术信息中心（NCBI）和许多其他网站。BLAST算法已经发展为分子生物学家提供了一套非常强大的搜索工具，可以在许多计算机平台上免费运行。这篇文章的目的是成为一个“用户指南”的原则，基本的BLAST。
INTRODUCTIONThe BLAST algorithm was developed as a way to perform DNA and protein sequence similarity searches by an algorithm that is faster than FASTA but considered to be equally as sensitive. Both of these methods follow a heuristic (tried-and-true) method that almost always works to find related sequences in a database search, but does not have the underlying guarantee of an optimal solution like the dynamic programming algorithm. FASTA finds short common patterns in query and database sequences and joins these into an alignment. BLAST is similar to FASTA, but gains a further increase in speed by searching only for rarer, more significant patterns in nucleic acid and protein sequences. BLAST is very popular due to its availability on the World Wide Web through a large server at the National Center for Biotechnology Information (NCBI) and at many other sites. The BLAST algorithm has evolved to provide molecular biologists with a set of very powerful search tools that are freely available to run on many computer platforms. This article is intended to be a "user's guide" to the principles underlying BLAST.