PreprintCited by 65Computational Drug Discovery MethodsMachine Learning in BioinformaticsExplainable Artificial Intelligence (XAI)

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

Open access
Karimi, Mostafa, Wu, Di, Wang, Zhangyang, Shen, Yang·2019·Journal of Chemical Information and Modeling

Preprint — published as 10.1021/acs.jcim.0c00866 · Paper page

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 inter-molecular contacts underlying affinities as a vehicle for interpretability, our large-scale interpretability assessment finds previously-used attention mechanisms inadequate. We thus formulate a hierarchical multi-objective learning problem whose predicted contacts form the basis for predicted affinities. And 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 inter-molecular 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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/2019.12.28.890103

Cites

67 of 67 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

5 of the 72 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Karimi, M., Wu, D., Wang, Z., & Shen, Y.
Affiliations
  • Texas A&M University System (US)
  • Texas A&M University (US)
  • The University of Texas at Austin (US)
Corresponding author
Shen, Yang
Venue
Journal of Chemical Information and Modeling
Publisher
openRxiv
Published
2019-12-30
Volume
61
Issue
1
Pages
46-66
ISSN
1549-9596 (ISSN-L)
OpenAlex
W3117081956
Cited by
64
References
72
Citations by year
2026: 6 · 2025: 9 · 2024: 10 · 2023: 14 · 2022: 11 · 2021: 9 · 2020: 5
FWCI
4.97
Type
journal article
Language
en
Open access
Locations
  • Journal of Chemical Information and Modeling (publishedVersion)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (1943008)
  • National Institutes of Health
  • High Performance Research Computing, Texas A and M University
  • National Institute of General Medical Sciences (R35GM124952)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computational Drug Discovery Methods
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
Keywords
intermolecular contacts, explainable machine learning, attention mechanism, hierarchical recurrent neural network, graph neural networks, protein sequence embeddings, attention regularization, solvent exposure, binding site prediction, structure-activity relationship, drug discovery
MeSH terms
Machine Learning, Deep Learning, Amino Acid Sequence, Proteins, Neural Networks, Computer

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