Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Compressive genomics for protein databases

Compressive genomics for protein databases

Thumbnail Image
Download
Name

Berger_Comprehensive genomics.pdf

Size

767.6 KB

Format

Adobe PDF

Checksum (MD5)

5208ac0634020a70e18f547d56f7c021

Author(s)
Daniels, Noah M.
•
Gallant, Andrew
•
Peng, Jian
•
Cowen, Lenore J.
•
Baym, Michael Hartmann
•
Berger Leighton, Bonnie
Date Issued
June 2013
Journal
Bioinformatics
Publisher
Oxford University Press
Citation
Daniels, N. M., A. Gallant, J. Peng, L. J. Cowen, M. Baym, and B. Berger. “Compressive Genomics for Protein Databases.” Bioinformatics 29, no. 13 (June 21, 2013): i283–i290.
Version
Final published version
Abstract
Motivation: The exponential growth of protein sequence databases has increasingly made the fundamental question of searching for homologs a computational bottleneck. The amount of unique data, however, is not growing nearly as fast; we can exploit this fact to greatly accelerate homology search. Acceleration of programs in the popular PSI/DELTA-BLAST family of tools will not only speed-up homology search directly but also the huge collection of other current programs that primarily interact with large protein databases via precisely these tools. Results: We introduce a suite of homology search tools, powered by compressively accelerated protein BLAST (CaBLASTP), which are significantly faster than and comparably accurate with all known state-of-the-art tools, including HHblits, DELTA-BLAST and PSI-BLAST. Further, our tools are implemented in a manner that allows direct substitution into existing analysis pipelines. The key idea is that we introduce a local similarity-based compression scheme that allows us to operate directly on the compressed data. Importantly, CaBLASTP’s runtime scales almost linearly in the amount of unique data, as opposed to current BLASTP variants, which scale linearly in the size of the full protein database being searched. Our compressive algorithms will speed-up many tasks, such as protein structure prediction and orthology mapping, which rely heavily on homology search.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-NonCommercial 3.0 Unported licence
http://creativecommons.org/licenses/by-nc/3.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/104045
DOI of Published Version
https://doi.org/10.1093/bioinformatics/btt214
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.