Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

PocketMatch: A new algorithm to compare binding sites in protein structures

View through CrossRef
Abstract Background: Recognizing similarities and deriving relationships among protein molecules is a fundamentalrequirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One ofthe main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariantmanner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unlesscombined with chemical nature of amino acids. Conclusions: A new algorithm has been developed to compare binding sites in accurate, efficient andhigh-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that alongwith the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250th second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.
Springer Science and Business Media LLC
Title: PocketMatch: A new algorithm to compare binding sites in protein structures
Description:
Abstract Background: Recognizing similarities and deriving relationships among protein molecules is a fundamentalrequirement in present-day biology.
Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds.
In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites.
Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol.
One ofthe main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity.
To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison.
Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariantmanner.
Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site.
The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites.
A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out.
Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent.
Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unlesscombined with chemical nature of amino acids.
Conclusions: A new algorithm has been developed to compare binding sites in accurate, efficient andhigh-throughput manner.
Though the representation used is conceptually simplistic, we demonstrate that alongwith the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity.
Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site.
The method is also fast and takes about 1/250th second for one comparison on a single processor.
A parallel version on BlueGene has also been implemented.

Related Results

PocketMatch: A new algorithm to compare binding sites in protein structures
PocketMatch: A new algorithm to compare binding sites in protein structures
Abstract Background: Recognizing similarities and deriving relationships among protein molecules is a fundamentalrequirement in present-day biology. Sim...
Endothelial Protein C Receptor
Endothelial Protein C Receptor
IntroductionThe protein C anticoagulant pathway plays a critical role in the negative regulation of the blood clotting response. The pathway is triggered by thrombin, which allows ...
Human papillomavirus type 16 E7 protein inhibits DNA binding by the retinoblastoma gene product.
Human papillomavirus type 16 E7 protein inhibits DNA binding by the retinoblastoma gene product.
The human papillomavirus E7 gene can transform murine fibroblasts and cooperate with other viral oncogenes in transforming primary cell cultures. One biochemical property associate...
Prediction of Drug-Target Binding Kinetics for Flexible Proteins by Comparative Binding Energy Analysis
Prediction of Drug-Target Binding Kinetics for Flexible Proteins by Comparative Binding Energy Analysis
There is growing consensus that the optimization of the kinetic parameters for drug-protein binding leads to improved drug efficacy. Therefore, computational methods have been deve...
Prediction of Drug-Target Binding Kinetics for Flexible Proteins by Comparative Binding Energy Analysis
Prediction of Drug-Target Binding Kinetics for Flexible Proteins by Comparative Binding Energy Analysis
There is growing consensus that the optimization of the kinetic parameters for drug-protein binding leads to improved drug efficacy. Therefore, computational methods have been deve...
Unidirectional potentiation of binding between two anti‐FBP MAbs: Evaluation of involved mechanisms
Unidirectional potentiation of binding between two anti‐FBP MAbs: Evaluation of involved mechanisms
AbstractThe monoclonal antibody MOv19 directed to a folate binding protein shows temperature‐dependent potentiation of binding of the noncompeting monoclonal antibody MOv18 to the ...
Integrating Explicit and Implicit Fullerene Models into UNRES Force Field for Protein Interaction Studies
Integrating Explicit and Implicit Fullerene Models into UNRES Force Field for Protein Interaction Studies
Fullerenes, particularly C60, exhibit unique properties that make them promising candidates for various applications, including drug delivery and nanomedicine. However, their inter...
E(Q)AGNN-PPIS: Attention Enhanced Equivariant Graph Neural Network for Protein-Protein Interaction Site Prediction
E(Q)AGNN-PPIS: Attention Enhanced Equivariant Graph Neural Network for Protein-Protein Interaction Site Prediction
AbstractIdentifying protein binding sites, the specific regions on a protein’s surface where interactions with other molecules occur, is crucial for understanding disease mechanism...

Back to Top