Using Multiple Microenvironments to Find Similar Ligand-Binding Sites: Application to Kinase Inhibitor Binding
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The recognition of cryptic small-molecular binding sites in protein structures is important for understanding off-target side effects and for recognizing potential new indications for existing drugs. Current methods focus on the geometry and detailed chemical interactions within putative binding pockets, but may not recognize distant similarities where dynamics or modified interactions allow one ligand to bind apparently divergent binding pockets. In this paper, we introduce an algorithm that seeks similar microenvironments within two binding sites, and assesses overall binding site similarity by the presence of multiple shared microenvironments. The method has relatively weak geometric requirements (to allow for conformational change or dynamics in both the ligand and the pocket) and uses multiple biophysical and biochemical measures to characterize the microenvironments (to allow for diverse modes of ligand binding). We term the algorithm PocketFEATURE, since it focuses on pockets using the FEATURE system for characterizing microenvironments. We validate PocketFEATURE first by showing that it can better discriminate sites that bind similar ligands from those that do not, and by showing that we can recognize FAD-binding sites on a proteome scale with Area Under the Curve (AUC) of 92%. We then apply PocketFEATURE to evolutionarily distant kinases, for which the method recognizes several proven distant relationships, and predicts unexpected shared ligand binding. Using experimental data from ChEMBL and Ambit, we show that at high significance level, 40 kinase pairs are predicted to share ligands. Some of these pairs offer new opportunities for inhibiting two proteins in a single pathway.
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
Cites
A quantitative analysis of kinase inhibitor selectivity
Karaman, M. W., Herrgard, S., Treiber, D. K., Gallant, P., Atteridge, C. E., Campbell, B. T., Chan, K. W., Ciceri, P., Davis, M. I., Edeen, P. T., et al. (2008) · Nature Biotechnology · doi:10.1038/nbt1358 · Cited by 2,466 · cited 2×
“Similarly, the Ambit panel provides high-throughput kinase selectivity profiling of 317 kinases against 37 known kinase inhibitors [29].”
BackgroundMethodImplications of protein flexibility for drug discovery
Teague, S. J. (2003) · Nature Reviews Drug Discovery · doi:10.1038/nrd1129 · Cited by 755 · cited 1×
“In particular, flexible matching can be critical in achieving high performance [11].”
Background
Cited by
Graph Convolutional Neural Networks for Predicting Drug-Target Interactions
Torng, W., & Altman, R. B. (2019) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.9b00628 · Cited by 371
Self-citationCritical assessment of methods of protein structure prediction (CASP)—Round XII
Moult, J., Fidelis, K., Kryshtafovych, A., Schwede, T., & Tramontano, A. (2018) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25415 · Cited by 326
3D deep convolutional neural networks for amino acid environment similarity analysis
Torng, W., & Altman, R. B. (2017) · BMC Bioinformatics · doi:10.1186/s12859-017-1702-0 · Cited by 142
Self-citationHigh precision protein functional site detection using 3D convolutional neural networks
Torng, W., & Altman, R. B. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty813 · Cited by 69
Self-citation(2022) · doi:10.1002/pro.4541 · Cited by 16
Metadata
- Authors
- Liu, T., & Altman, R. B.
- Venue
- PLoS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2011-12-29
- Volume
- 7
- Issue
- 12
- Pages
- e1002326
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2019523557
- Cited by
- 63
- References
- 2
- FWCI
- 4.78
- 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
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.