PLoS ONEBioinformaticsPeer-reviewed journal article
Incremental BLAST: incremental addition of new sequence databases through e-value correction
Sajal DashiD, Sarthok Rasique RahmaniD, Heather M. HinesiD, Wu-chun Feng
Abstract
MotivationSearch results from local alignment search tools use statistical parameters sensitive to the size of the database. NCBI BLAST, for example, reports important matches using similarity scores and expect or e-values calculated against database size. Over the course of an investigation, the database grows and the best matches may change. To update the results of a sequence similarity search to find the most optimal hits, bioinformaticians must rerun the BLAST search against the entire database; this translates into irredeemable spent time, money, and computational resources.\n\nResultsWe develop an efficient way to redeem spent BLAST search effort by introducing the Incremental BLAST. This tool makes use of the previous BLAST search results as it conducts new searches on only the incremental part of the database, recomputes statistical metrics such as e-values and combines these two sets of results to produce updated results. We develop statistics for correcting e-values of any BLAST result against any arbitrary sequence database. The experimental results and accuracy analysis demonstrate that Incremental BLAST can provide search results identical to NCBI BLAST at a significantly reduced computational cost. We apply three case studies to showcase different use cases where Incremental BLAST can make biological discovery more efficiently at a reduced cost. This tool can be used to update sequence blasts during the course of genomic and transcriptomic projects, such as in re-annotation projects, and to conduct incremental addition of taxon-specific sequences to a BLAST database. Incremental BLAST performs (1 +{delta} )/{delta} times faster than NCBI BLAST for{delta} fraction of database growth.\n\nAvailabilityIncremental BLAST is available at https://bitbucket.org/sajal000/incremental-blast.\n\nContactsajal@vt.edu\n\nSupplementary informationSupplementary data are available at https://bitbucket.org/sajal000/incremental-blast
- Citations
- 13
- FWCI
- 0.71
- Field percentile
- top 36%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- iSeqsSearch: Incremental Protein Search for iBlast/iMMSeqs2/iDiamond
Hyunwoo Yoo, Mohammad S. Refahi, … GAIL L. ROSEN·bioRxiv·Sep 9, 2024
- ElasticBLAST: Accelerating Sequence Search via Cloud Computing
Camacho Christiam, Grzegorz M. Boratyn, … Thomas Madden·BMC BioinformaticsPeer-reviewed·Mar 26, 2023
- Simple adjustment of the sequence weight algorithm remarkably enhances PSI-BLAST performance
Toshiyuki Oda, Kyungtaek Lim, Kentaro Tomii·BMC BioinformaticsPeer-reviewed·Jun 2, 2017
- An Incrementally Updatable and Scalable System for Large-Scale Sequence Search using LSM Trees
Fatemeh Almodaresi, Jamshed Khan, … Rob Patro·bioRxiv·Feb 5, 2021
- Sequenceserver: a modern graphical user interface for custom BLAST databases
Anurag Priyam, Ben J Woodcroft, … Yannick Wurm·Molecular Biology and EvolutionPeer-reviewed·Aug 14, 2019
- A BLAST from the past: revisiting blastp's E-value
Yang Young Lu, William Stafford Noble, Uri Keich·BioinformaticsPeer-reviewed·Nov 28, 2024