Journal
BIOINFORMATICS
Volume 24, Issue 16, Pages 1757-1764Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btn322
Keywords
-
Categories
Funding
- Intramural NIH HHS Funding Source: Medline
Ask authors/readers for more resources
Motivation: The BLAST software package for sequence comparison speeds up homology search by preprocessing a query sequence into a lookup table. Numerous research studies have suggested that preprocessing the database instead would give better performance. However, production usage of sequence comparison methods that preprocess the database has been limited to programs such as BLAT and SSAHA that are designed to find matches when query and database subsequences are highly similar. Results: We developed a new version of the MegaBLAST module of BLAST that does the initial phase of finding short seeds for matches by searching a database index. We also developed a program makembindexthat preprocesses the database into a data structure for rapid seed searching. We show that the new indexed MegaBLAST is faster than the non-indexed version for most practical uses. We show that indexed MegaBLAST is faster than miBLAST, another implementation of BLAST nucleotide searching with a preprocessed database, for most of the 200 queries we tested. To deploy indexed MegaBLAST as part of NCBIsWeb BLAST service, the storage of databases and the queueing mechanism were modified, so that some machines are now dedicated to serving queries for a specific database. The response time for such Web queries is now faster than it was when each computer handled queries for multiple databases.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available