Bioinformatics Vol. 19 no. 12 2003
Pages 1492-1496
© 2003 Oxford University Press
Serial BLAST searching
The Wellcome Trust Sanger Institute, Hinxton, Cambridgeshire, CB10 1SA, UK
Received on October 27, 2002
; revised on February 11, 2003
; accepted on February 27, 2003
Motivation: The translating BLAST algorithms are powerful tools for finding protein-coding genes because they identify amino acid similarities in nucleotide sequences. Unfortunately, these kinds of searches are computationally intensive and often represent bottlenecks in sequence analysis pipelines. Tuning parameters for speed can make the searches much faster, but one risks losing low-scoring alignments. However, high scoring alignments are relatively resistant to such changes in parameters, and this fact makes it possible to use a serial strategy where a fast, insensitive search is used to pre-screen a database for similar sequences, and a slow, sensitive search is used to produce the sequence alignments.
Results: Serial BLAST searches improve both the speed and sensitivity.
Contact: ik1{at}sanger.ac.uk
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
V. Gotea, V. Veeramachaneni, and W. Makalowski Mastering seeds for genomic size nucleotide BLAST searches Nucleic Acids Res., December 1, 2003; 31(23): 6935 - 6941. [Abstract] [Full Text] [PDF] |
||||
