Fast and accurate protein substructure searching with simulated annealing and GPUs

Alex D. Stivala, Peter J. Stuckey, Anthony I. Wirth

Research output: Contribution to journalArticleResearchpeer-review

31 Citations (Scopus)

Abstract

Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioinformatics. While there are many existing methods for structural similarity searching, faster and more accurate approaches are still required, and few current methods are capable of substructure (motif) searching.Results: We developed an improved heuristic for tableau-based protein structure and substructure searching using simulated annealing, that is as fast or faster and comparable in accuracy, with some widely used existing methods. Furthermore, we created a parallel implementation on a modern graphics processing unit (GPU).Conclusions: The GPU implementation achieves up to 34 times speedup over the CPU implementation of tableau-based structure search with simulated annealing, making it one of the fastest available methods. To the best of our knowledge, this is the first application of a GPU to the protein structural search problem.

Original languageEnglish
Article number446
Number of pages17
JournalBMC Bioinformatics
Volume11
DOIs
Publication statusPublished - 3 Sep 2010
Externally publishedYes

Cite this