Evidence map›Paper›PMID 33347301›Full record

ArticleJournal of chemical information and modeling2021

Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts.

Mostafa Karimi, Di Wu, Zhangyang Wang, Yang Shen

Abstract read
In one paragraph

Article in Journal of chemical information and modeling, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
19citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

19 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Review
  4. Article
  5. Article
  6. Review
  7. Review
  8. Review
  9. Article
  10. Graph Domain Adaptation via Theory-Grounded Spectral Regularization.... International Conference on Learning Representations · 2023
    Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Comprehensive Survey of Recent Drug Discovery Using Deep Learning.International journal of molecular sciences · 2021
    Review
  16. Article
  17. Review
  18. Article
  19. When Does Self-Supervision Help Graph Convolutional Networks?Proceedings of machine learning research · 2020
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Mostafa KarimiDepartment of Electrical and Computer Engineering, Texas A&M University, College Station, Texas 77843, United States.
Di WuDepartment of Electrical and Computer Engineering, Texas A&M University, College Station, Texas 77843, United States.
Zhangyang WangDepartment of Computer Science and Engineering, Texas A&M University, College Station, Texas 77843, United States.
Yang ShenDepartment of Electrical and Computer Engineering, Texas A&M University, College Station, Texas 77843, United States.ORCID 0000-0002-1703-7796

Funding

Unraveling molecular and system-level mechanisms of human disease-associated protein mutationsR35GM124952 · NIGMS · TEXAS ENGINEERING EXPERIMENT STATION · PI Yang Shen · 2017 to 2026
$2.9M
NIGMS NIH HHS R35 GM124952
6 · The paper itself

Abstract

Predicting compound-protein affinity is beneficial for accelerating drug discovery. Doing so without the often-unavailable structure data is gaining interest. However, recent progress in structure-free affinity prediction, made by machine learning, focuses on accuracy but leaves much to be desired for interpretability. Defining intermolecular contacts underlying affinities as a vehicle for interpretability; our large-scale interpretability assessment finds previously used attention mechanisms inadequate. We thus formulate a hierarchical multiobjective learning problem, where predicted contacts form the basis for predicted affinities. We solve the problem by embedding protein sequences (by hierarchical recurrent neural networks) and compound graphs (by graph neural networks) with joint attentions between protein residues and compound atoms. We further introduce three methodological advances to enhance interpretability: (1) structure-aware regularization of attentions using protein sequence-predicted solvent exposure and residue-residue contact maps; (2) supervision of attentions using known intermolecular contacts in training data; and (3) an intrinsically explainable architecture where atomic-level contacts or "relations" lead to molecular-level affinity prediction. The first two and all three advances result in DeepAffinity+ and DeepRelations, respectively. Our methods show generalizability in affinity prediction for molecules that are new and dissimilar to training examples. Moreover, they show superior interpretability compared to state-of-the-art interpretable methods: with similar or better affinity prediction, they boost the AUPRC of contact prediction by around 33-, 35-, 10-, and 9-fold for the default test, new-compound, new-protein, and both-new sets, respectively. We further demonstrate their potential utilities in contact-assisted docking, structure-free binding site prediction, and structure-activity relationship studies without docking. Our study represents the first model development and systematic model assessment dedicated to interpretable machine learning for structure-free compound-protein affinity prediction.

Indexed as

Deep LearningProteinsAmino Acid SequenceMachine LearningNeural Networks, ComputerProteins

Identifiers

PMID33347301
PMCPMC7987499

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.