- Poster presentation
- Open Access
A new method for rapid comparison of protein binding pockets by capturing spatial distributions
Journal of Cheminformatics volume 6, Article number: P45 (2014)
Efficient determination of structural similarities between protein binding pockets is an important challenge in computational chemistry. A degree of similarity in the mutual comparison is often estimated in terms of graphs and by calculating a metric such as the maximum shared common subgraph. Cavbase  was developed as a tool for the automatic detection, storage and classification of putative protein binding sites. Cavbase assigns so-called pseudocenters to the cavity-flanking amino acids, which characterize their physicochemical properties with respect to molecular recognition. Subsequently, the pseudocenters are used as graph nodes to accomplish mutual binding site comparisons. This way of modeling protein binding sites, however, tends to be computationally very demanding, which often leads to very lengthy evaluations of the similarity measures.
In this study we propose Rapid Pocket Matching using Distances (RAPMAD), a new modeling formalism for Cavbase entries which allows for highly efficient similarity calculations. Here, protein binding sites are represented by sets of distance histograms based on specific spatial reference points  in order to characterize the distribution of pseudocenters within the cavity. The histograms can be both generated and compared with linear complexity. Attaining a speed of approximately 20,000 comparisons per second, pocket comparisons across large datasets and even screenings of entire databases become easily feasible.
We demonstrate the discriminative power and the orders of magnitude faster runtime of this novel method by carrying out several classification and retrieval experiments. Among others, datasets of protein cavities hosting specific cofactors are used for classification experiments, where RAPMAD results in a considerably higher rate of correct classifications compared to other alternative approaches while it requires only a fraction of their runtime. Moreover, a set of proteases  was investigated, where it turned out that RAPMAD is able to distinguish between different Merops clans such as serine or metallo proteases.
Schmitt S, Kuhn D, Klebe G: A new method to detect related function among proteins independent of sequence and fold homology. J Mol Biol. 2002, 323 (2): 387-406. 10.1016/S0022-2836(02)00811-2.
Ballester PJ, Richards WG: Ultrafast shape recognition to search compound databases for similar molecular shapes. J Comput Chem. 2007, 28 (10): 1711-1723. 10.1002/jcc.20681.
Glinca S, Klebe G: Cavities Tell More than Sequences: Exploring Functional Relationships of Proteases via Binding Pockets. J Chem Inf Model. 2013, 53 (8): 2082-2092. 10.1021/ci300550a.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Krotzky, T., Klebe, G. A new method for rapid comparison of protein binding pockets by capturing spatial distributions. J Cheminform 6 (Suppl 1), P45 (2014). https://doi.org/10.1186/1758-2946-6-S1-P45
- Protein Binding Site
- Graph Node
- Lengthy Evaluation
- Efficient Determination
- Mutual Comparison