Parallel-ProBiS: fast parallel algorithm for local structural comparison of protein structures and binding sites

J Comput Chem. 2012 Oct 15;33(27):2199-203. doi: 10.1002/jcc.23048. Epub 2012 Jun 20.

Abstract

The ProBiS algorithm performs a local structural comparison of the query protein surface against the nonredundant database of protein structures. It finds proteins that have binding sites in common with the query protein. Here, we present a new parallelized algorithm, Parallel-ProBiS, for detecting similar binding sites on clusters of computers. The obtained speedups of the parallel ProBiS scale almost ideally with the number of computing cores up to about 64 computing cores. Scaling is better for larger than for smaller query proteins. For a protein with almost 600 amino acids, the maximum speedup of 180 was achieved on two interconnected clusters with 248 computing cores. Source code of Parallel-ProBiS is available for download free for academic users at http://probis.cmm.ki.si/download.

Publication types

  • Comparative Study
  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Binding Sites
  • Computational Biology
  • Databases, Protein
  • Protein Conformation
  • Proteins / chemistry*

Substances

  • Proteins