bioRxivBioinformaticsPreprint
EnTrance: Exploration of Entropy Scaling Ball Cover Search in Protein Sequences
Yoonjin KimiD, Zhen Yang GuoiD, Jeffrey A. Robertson, Benjamin ReidysiD, Ziyan ZhangiD, Lenwood S. HeathiD
Abstract
Biological sequence alignment using computational power has received increasing attention as technology develops. It is important to predict if a novel DNA sequence is potentially dangerous by determining its taxonomic identity and functional characteristics through sequence identification. This task can be facilitated by the rapidly increasing amounts of biological data in DNA and protein databases thanks to the corresponding increase in computational and storage costs. Unfortunately, the growth in biological databases has caused difficulty in exploiting this information. EnTrance presents an approach that can expedite the analysis of this large database by employing entropy scaling. This allows scaling with the amount of entropy in the database instead of scaling with the absolute size of the database. Since DNA and protein sequences are biologically meaningful, the space of biological sequences demonstrates the structure exploited by entropy scaling. As biological sequence databases grow, taking advantage of this structure can be extremely beneficial for reducing query times. EnTrance, the entropy scaling search algorithm introduced here, accelerates the biological sequence search exemplified by tools such as BLAST. EnTrance does this by utilizing a two step search approach. In this fashion, EnTrance quickly reduces the number of potential matches before more exhaustively searching the remaining sequences. Tests of EnTrance show that this approach can lead to improved query times. However, constructing the required entropy scaling indices beforehand can be challenging. To improve performance, EnTrance investigates several ideas for accelerating index build time that supports entropy scaling searches. In particular, EnTrance makes full use of the concurrency features of Go language greatly reducing the index build time. Our results identify key tradeoffs and demonstrate that there is potential in using these techniques for sequence similarity searches. Finally, EnTrance returns more matches and higher percentage identity matches when compared with existing tools.
- assay: protein sequence
- research focus: benchmarking
- research focus: database / resource
- research focus: software / tool
- approach: statistical model
- Citations
- 0
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
- A new paradigm for biological sequence retrieval inspired by natural language processing and database research
Axel-Jan Rousseau, Sébastien Lemal, … Dirk Valkenborg·bioRxiv·Nov 7, 2023
- SW#db: GPU-accelerated exact sequence similarity database search
Matija Korpar, Martin Sosic, … Mile Sikic·bioRxiv·Jan 14, 2015
- An Incrementally Updatable and Scalable System for Large-Scale Sequence Search using LSM Trees
Fatemeh Almodaresi, Jamshed Khan, … Rob Patro·bioRxiv·Feb 5, 2021
- Mantis: A Fast, Small, and Exact Large-Scale Sequence Search Index
Prashant Pandey, Fatemeh Almodaresi, … Rob Patro·Cell SystemsPeer-reviewed·Jun 21, 2018
- Scalable sequence database search using Partitioned Aggregated Bloom Comb-Trees
Camille Marchet, Antoine Limasset·BioinformaticsPeer-reviewed·May 25, 2023
- Incremental BLAST: incremental addition of new sequence databases through e-value correction
Sajal Dash, Sarthok Rasique Rahman, … Wu-chun Feng·PLoS ONEPeer-reviewed·Apr 22, 2021