Suppr超能文献

使用基本局部比对搜索工具(BLAST)。

Using the Basic Local Alignment Search Tool (BLAST).

作者信息

Mount David W

出版信息

CSH Protoc. 2007 Jul 1;2007:pdb.top17. doi: 10.1101/pdb.top17.

Abstract

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.

摘要

引言

BLAST算法是作为一种通过比FASTA更快但被认为同样灵敏的算法来进行DNA和蛋白质序列相似性搜索的方法而开发的。这两种方法都遵循一种启发式(经过验证)方法,这种方法在数据库搜索中几乎总能找到相关序列,但不像动态规划算法那样有最优解的根本保证。FASTA在查询序列和数据库序列中找到短的共同模式,并将它们拼接成一个比对。BLAST与FASTA相似,但通过仅在核酸和蛋白质序列中搜索更罕见、更显著的模式,进一步提高了速度。由于它可通过美国国家生物技术信息中心(NCBI)的大型服务器以及许多其他网站在万维网上获取,BLAST非常受欢迎。BLAST算法已经发展到为分子生物学家提供了一组非常强大的搜索工具,这些工具可免费在许多计算机平台上运行。本文旨在成为BLAST背后原理的“用户指南”。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验