BLAST
|
|
- For other uses, see BLAST (disambiguation).
In bioinformatics, Basic Local Alignment Search Tool, or BLAST, is an algorithm for comparing biological sequences, such as the amino-acid sequences of different proteins or the DNA sequences. Given a library or database of sequences, a BLAST search enables a researcher to look for sequences that resemble a given sequence of interest. For example, following the discovery of a previously unknown gene in the mouse, a scientist will typically perform a BLAST search of the human genome to see if human beings carry a similar gene; BLAST will identify sequences in the human genome that resemble the mouse gene based on similarity of sequence.
BLAST is one of the most widely used bioinformatics programs, probably because it addresses a fundamental problem and the algorithm emphasizes speed over sensitivity. This emphasis on speed is vital to making the algorithm practical on the huge genome databases currently available, although subsequent algorithms can be even faster.
Examples of other questions that researchers use BLAST to answer are
- Which bacterial species have a protein that is related in lineage to a certain protein whose amino-acid sequence I know?
- Where does the DNA that I've just sequenced come from?
- What other genes encode proteins that exhibit structures or motifs such as the one I've just determined?
BLAST is also often as part of other algorithms that require approximate sequence matching.
The BLAST algorithm and a computer program that implements it were developed by Stephen Altschul, Warren Gish, David Lipman at the U.S. National Center for Biotechnology Information (NCBI), Webb Miller at The Pennsylvania State University, and Gene Myers at the University of Arizona . It is available on the web at [1] (http://www.ncbi.nlm.nih.gov/BLAST/).
The original paper "Altschul, SF, W Gish, W Miller, EW Myers, and DJ Lipman. Basic local alignment search tool. J Mol Biol 215(3):403-10, 1990." was the most highly cited paper published in the 1990s.
Algorithm
To run, BLAST requires two sequences as input: a query sequence (also called the target sequence) and a sequence database. BLAST will find subsequences in the query that is similar to a subsequence in the database. In typical usage, the query sequence is much smaller than the database, e.g., the query may be 1 thousand nucleotides while the database is several billion nucleotides.
To define what it means for two subsequences to be "similar", BLAST uses the Smith-Waterman algorithm. Unfortunately, the Smith-Waterman algorithm is too slow to use on huge genome databases currently available. Therefore, the BLAST algorithm works by searching for small regions that are exactly the same in the two sequences and then attempting to extend the alignment to either side until the comparison score reaches a certain threshold. These heuristics used to speed the basic Smith-Waterman algorithm are the key technical innovation of BLAST programs, and the more practical CPU requirements explain why BLAST is vastly more used than the Smith-Waterman algorithm.
An extremely fast alternative to BLAST that compares nucleotide sequences to the genome is BLAT (Blast Like Alignment Tool). A more precise, and much slower, alternative to BLAST is the Smith Waterman.
Program
The BLAST program can either be downloaded and run as a command-line utility "blastall" or accessed for free over the web. The BLAST web server, hosted by the NCBI, allows anyone with a web browser to perform similarity searches against constantly updated databases of proteins and DNA that include most of the newly sequenced organisms.
BLAST is actually a family of programs (all included in the blastall executable). The following are some of the programs, ranked mostly in order of importance:
- Nucleotide-nucleotide BLAST (blastn): This program, given a DNA query, returns the most similar DNA sequences from the DNA database that the user specifies.
- Protein-protein BLAST (blastp): This program, given a protein query, returns the most similar protein sequences from the protein database that the user specifies.
- Position-Specific Iterative BLAST (PSI-BLAST): One of the more recent BLAST programs, this program is used for finding distant relatives of a protein. First, a list of all closely related proteins is created. Then these proteins are combined into a "profile" that is a sort of average sequence. A query against the protein database is then run using this profile, and a larger group of proteins found. This larger group is used to construct another profile, and the process is repeated.
By including related proteins in the search, PSI-BLAST is much more sensitive in picking up distant evolutionary relationships than the standard protein-protein BLAST. - Nucleotide-protein 6-frame translation (blastx): This program compares the six-frame conceptual translation products of a nucleotide query sequence (both strands) against a protein sequence database. This can be very slow.
- Nucleotide-nucleotide 6-frame translation (tblastx): This program is the slowest of the BLAST family. It translates the query nucleotide sequence in all six possible frames and compares the resulting proteins. The purpose of tblastx is to find very distant relationships between nucleotide sequences.
- Protein-nucleotide 6-frame translation (tblastn): This program translates the target database in all 6 frames and compares to a protein query sequence.
- Large numbers of query sequences (megablast): When comparing large numbers of input sequences via the command-line BLAST, "megablast" is much faster than running BLAST multiple times.
External links
- NCBI-BLAST Home page (http://www.ncbi.nlm.nih.gov/BLAST/)
- NCBI-BLAST Tutorial (http://www.ncbi.nlm.nih.gov/Education/BLASTinfo/tut1.html)
- WU-BLAST (http://blast.wustl.edu/) (Another implementation of BLAST.)
- BioASP BLAST (http://services.bioasp.nl/blast/cgi-bin/blast.cgi) (Bioinformatics Application Services Platform, running BLAST)de:BLAST-Algorithmus