PocketMatch: A new algorithm to compare binding sites in protein structures
Open accessThe DOI matches its Crossref record.
Abstract
BACKGROUND: Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement 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 of the 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 invariant manner. 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. A comparison with other site matching algorithms is also presented. 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, unless combined with chemical nature of amino acids. CONCLUSION: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Structure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H. J. M., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 892
Raman, K., Yeturu, K., & Chandra, N. (2008) · BMC Systems Biology · doi:10.1186/1752-0509-2-109 · Cited by 280
Self-citationDeep contrastive learning enables genome-wide virtual screening
Jia, Y., Gao, B., Tan, J., Zheng, J., Hong, X., Zhu, W., Tan, H., Xiao, Y., Tan, L., Cai, H., et al. (2026) · Science · doi:10.1126/science.ads9530 · Cited by 66
Bhagavat, R., Sankar, S., Srinivasan, N., & Chandra, N. (2018) · Structure · doi:10.1016/j.str.2018.02.001 · Cited by 41
Self-citationCavitySpace: A Database of Potential Ligand Binding Sites in the Human Proteome
Wang, S., Lin, H., Huang, Z., He, Y., Deng, X., Xu, Y., Pei, J., & Lai, L. (2022) · Biomolecules · doi:10.3390/biom12070967 · Cited by 39
“As similar binding sites may bind the same or similar ligands and have similar functions, we used PocketMatch [33] to compare binding sites and the PMSmax score to evaluate the overall pocket similarity (see the Supplementary Methods for details).”
Method
Metadata
- Authors
- Yeturu, K., & Chandra, N.
- Venue
- BMC Bioinformatics
- Published
- 2008-12
- Volume
- 9
- Issue
- 1
- Pages
- 543-543
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2040595595
- Cited by
- 155
- References
- 0
- FWCI
- 3.10
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: PocketMatch: A new algorithm to compare binding sites in protein structures. https://app.cochat.ai/papers/10.1186/1471-2105-9-543
- The paper
- Yeturu, K., & Chandra, N. (2008). PocketMatch: A new algorithm to compare binding sites in protein structures. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-9-543
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.