Improved gapped alignment in BLAST.
Homology search is a key tool for understanding the role, structure, and biochemical function of genomic sequences. The most popular technique for rapid homology search is BLAST, which has been in widespread use within universities, research centers, and commercial enterprises since the early 1990s. In this paper, we propose a new step in the BLAST algorithm to reduce the computational cost of searching with negligible effect on accuracy. This new step-semigapped alignment-compromises between the efficiency of ungapped alignment and the accuracy of gapped alignment, allowing BLAST to accurately filter sequences with lower computational cost. In addition, we propose a heuristic-restricted insertion alignment-that avoids unlikely evolutionary paths with the aim of reducing gapped alignment cost with negligible effect on accuracy. Together, after including an optimization of the local alignment recursion, our two techniques more than double the speed of the gapped alignment stages in BLAST. We conclude that our techniques are an important improvement to the BLAST algorithm. Source code for the alignment algorithms is available for download at http://www.bsg.rmit.edu.au/iga/.
Cameron
Michael
M
School of Computer Science and Information Technology, RMIT University, GPO Box 2476V, Melbourne, Australia. mcam@cs.rmit.edu.au
Williams
Hugh E
HE
Cannane
Adam
A
D000465:Algorithms; D000595:Amino Acid Sequence; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D020407:Internet; D008969:Molecular Sequence Data; D015203:Reproducibility of Results; D016415:Sequence Alignment / Q000191:economics / Q000379:methods*; D017386:Sequence Homology, Amino Acid