Integrative geometric-hashing approaches to binding site modeling and ligand-protein interaction prediction

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramount to understanding proteins' biological mechanisms and hence to the development of therapeutic agents. A ligand is most likely to bind in the largest pocket on the surface of the protein. Moreover, it requires that the pocket meets certain structural and geometric criteria that allow the ligand to "anchor" in place by forming stabilizing interactions with the protein. Based on this logic, many geometry-based algorithms have been developed to predict protein-ligand interactions. Here we investigate a geometric-hashing based algorithm - to see how well it distinguishes proteins that do and do not bind a ligand, and propose enhancements that improve its robustness. We also introduce an alternative way of integrating geometric and biochemical properties of multiple binding mechanisms into a single representation. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Lipinski-Kruszka, J., & Singh, R. (2007). Integrative geometric-hashing approaches to binding site modeling and ligand-protein interaction prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4841 LNCS, pp. 179–188). Springer Verlag. https://doi.org/10.1007/978-3-540-76858-6_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free