计算机科学
加入
集合(抽象数据类型)
相似性(几何)
启发式
序列比对
多序列比对
序列数据库
数据挖掘
最近邻搜索
序列(生物学)
史密斯-沃特曼算法
情报检索
人工智能
理论计算机科学
生物
遗传学
图像(数学)
肽序列
基因
程序设计语言
出处
期刊:CSH Protocols
[Cold Spring Harbor Laboratory Press]
日期:2007-07-01
卷期号:2007 (7): pdb.top17-pdb.top17
被引量:613
摘要
INTRODUCTION The 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.
科研通智能强力驱动
Strongly Powered by AbleSci AI