Cite as: Cold Spring Harb. Protoc.; 2007; doi:10.1101/pdb.top17

This Protocol
Right arrow Full Text
Right arrow Update/discuss this protocolDiscussion icon
Right arrow Alert me when this protocol is cited
Right arrow Alert me when comments are published
Right arrow Alert me if a correction is posted
Services
Right arrow Similar protocols in this database
Right arrow Alert me to new releases of protocols
Right arrow Save to Personal Folders
Right arrow Download to citation manager
Right arrow Printer-friendly versionPrinter-friendly version
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Mount, D. W.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Mount, D. W.
Related Collections
Right arrow Bioinformatics/Genomics, general
Right arrow Alignment of Sequences
Right arrow Alignment of Sequences, general
Right arrow Alignment of Pairs of Sequences
Right arrow Multiple Sequence Alignment
Right arrow Gene Prediction and Regulation
Right arrow Sequence Database Searching
Right arrow Computational Biology
Right arrow Genetic Variation
Right arrow Proteins and Proteomics, general
Right arrow Proteomics
Right arrow Genome Analysis
Right arrowRelated Articles
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?
BSN globe

topic_introductionTopic Introduction

Using the Basic Local Alignment Search Tool (BLAST)

David W. Mount

Adapted from "Sequence Database Searching for Similar Sequences," Chapter 6, in Bioinformatics: Sequence and Genome Analysis, 2nd edition, by David W. Mount. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY, USA, 2004.


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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?

Related Articles

Studies of Varying Alignment Algorithm, Amino Acid Scoring Matrix, and Gap Penalties
David W. Mount
CSH Protocols 2008: 60. [Abstract] [Full Text]

Recommended Steps for a FASTA Search
David W. Mount
CSH Protocols 2007: 40. [Abstract] [Full Text]

Steps Used by the BLAST Algorithm
David W. Mount
CSH Protocols 2007: 41. [Abstract] [Full Text]

Strategies for Sequence Similarity Database Searches
David W. Mount
CSH Protocols 2007: 15. [Abstract] [Full Text]

Using a FASTA Sequence Database Similarity Search
David W. Mount
CSH Protocols 2007: 16. [Abstract] [Full Text]



This article has been cited by other articles:


Home page
 CSH ProtocolsHome page
D. W. Mount
Studies of Varying Alignment Algorithm, Amino Acid Scoring Matrix, and Gap Penalties
CSH Protocols, June 1, 2008; 2008(7): pdb.ip60 - pdb.ip60.
[Abstract] [Full Text]

Home page
 CSH ProtocolsHome page
D. W. Mount
Using PAM Matrices in Sequence Alignments
CSH Protocols, June 1, 2008; 2008(7): pdb.top38 - pdb.top38.
[Abstract] [Full Text]

Home page
 CSH ProtocolsHome page
D. W. Mount
Using Gaps and Gap Penalties to Optimize Pairwise Sequence Alignments
CSH Protocols, June 1, 2008; 2008(7): pdb.top40 - pdb.top40.
[Abstract] [Full Text]