InteractionNet: Modeling and Explaining of Noncovalent Protein-Ligand Interactions with Noncovalent Graph Neural Network and Layer-Wise Relevance Propagation

• URL: http://arxiv.org/abs/2005.13438v1
• Date: Tue, 12 May 2020 12:46:44 GMT
• Title: InteractionNet: Modeling and Explaining of Noncovalent Protein-Ligand Interactions with Noncovalent Graph Neural Network and Layer-Wise Relevance Propagation
• Abstract summary: We propose a graph neural network architecture to learn noncovalent protein-ligand interactions. We show that our model successfully predicted the noncovalent interactions in both performance and relevance in chemical interpretation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Expanding the scope of graph-based, deep-learning models to noncovalent protein-ligand interactions has earned increasing attention in structure-based drug design. Modeling the protein-ligand interactions with graph neural networks (GNNs) has experienced difficulties in the conversion of protein-ligand complex structures into the graph representation and left questions regarding whether the trained models properly learn the appropriate noncovalent interactions. Here, we proposed a GNN architecture, denoted as InteractionNet, which learns two separated molecular graphs, being covalent and noncovalent, through distinct convolution layers. We also analyzed the InteractionNet model with an explainability technique, i.e., layer-wise relevance propagation, for examination of the chemical relevance of the model's predictions. Separation of the covalent and noncovalent convolutional steps made it possible to evaluate the contribution of each step independently and analyze the graph-building strategy for noncovalent interactions. We applied InteractionNet to the prediction of protein-ligand binding affinity and showed that our model successfully predicted the noncovalent interactions in both performance and relevance in chemical interpretation.

Related papers

• A Large-Scale Dataset and Benchmark: Do Protein-Ligand Models Learn Binding Sites or Just Binding Likelihood? [29.589714550752348]
  We introduce InteractBind, a large-scale protein-ligand dataset comprising approximately 100k protein-ligand pairs.<n>The core fine-grained task is that of binding-site localization.<n>We evaluate eight existing sequence-based and interaction-aware models, assessing binary binding prediction and binding-site localization.
  arXiv  Detail & Related papers  (2026-05-21T20:50:03Z)
• Multi-Level Fusion Graph Neural Network for Molecule Property Prediction [7.496721948662087]
  We propose a Multi-Level Fusion Graph Neural Network (MLFGNN) that integrates Graph Attention Networks and a novel Graph Transformer.<n>Experiments on multiple benchmark datasets demonstrate that MLFGNN consistently outperforms state-of-the-art methods in both classification and regression tasks.
  arXiv  Detail & Related papers  (2025-07-04T09:38:19Z)
• Exploring the Nexus of Many-Body Theories through Neural Network Techniques: the Tangent Model [4.955567578189708]
  We present a physically informed neural network representation of the effective interactions associated with coupled-cluster downfolding models. The representation allows us to evaluate the effective interactions efficiently for various geometrical configurations of chemical systems.
  arXiv  Detail & Related papers  (2025-01-27T05:36:55Z)
• A deep graph model for the signed interaction prediction in biological network [1.03121181235382]
  Predicting signed interactions in biological networks is crucial for understanding drug mechanisms and facilitating drug repurposing. textbfRGCNTD is designed to predict both polar (e.g. activation, inhibition) and non-polar (e.g. binding, affect) chemical-gene interactions. We introduce new evaluation metrics, textitAUCtextsubscriptpolarity and textitCP@500, to assess the model's ability to differentiate interaction types.
  arXiv  Detail & Related papers  (2024-07-10T04:28:21Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• On the Ability of Graph Neural Networks to Model Interactions Between Vertices [14.909298522361306]
  Graph neural networks (GNNs) are widely used for modeling complex interactions between entities represented as vertices of a graph. Despite recent efforts to theoretically analyze the expressive power of GNNs, a formal characterization of their ability to model interactions is lacking.
  arXiv  Detail & Related papers  (2022-11-29T18:58:07Z)
• Learning Heterogeneous Interaction Strengths by Trajectory Prediction with Graph Neural Network [0.0]
  We propose the attentive relational inference network (RAIN) to infer continuously weighted interaction graphs without any ground-truth interaction strengths. We show that our RAIN model with the PA mechanism accurately infers continuous interaction strengths for simulated physical systems in an unsupervised manner.
  arXiv  Detail & Related papers  (2022-08-28T09:13:33Z)
• Effects of Graph Network Connections on The Efficiency of Quantum Annealing [0.0]
  Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA) Here, we explore the interplay of different interaction types between the spins and the structure of the underlying network on the performance of QA. We find that the QA performance of the Ising model shows less variation with the change of graph structure among different interaction types.
  arXiv  Detail & Related papers  (2021-11-22T18:39:13Z)
• Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity [52.67037774136973]
  Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. We propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool)
  arXiv  Detail & Related papers  (2021-07-21T03:34:09Z)
• Distance-aware Molecule Graph Attention Network for Drug-Target Binding Affinity Prediction [54.93890176891602]
  We propose a diStance-aware Molecule graph Attention Network (S-MAN) tailored to drug-target binding affinity prediction. As a dedicated solution, we first propose a position encoding mechanism to integrate the topological structure and spatial position information into the constructed pocket-ligand graph. We also propose a novel edge-node hierarchical attentive aggregation structure which has edge-level aggregation and node-level aggregation.
  arXiv  Detail & Related papers  (2020-12-17T17:44:01Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)
• Multi-View Graph Neural Networks for Molecular Property Prediction [67.54644592806876]
  We present Multi-View Graph Neural Network (MV-GNN), a multi-view message passing architecture. In MV-GNN, we introduce a shared self-attentive readout component and disagreement loss to stabilize the training process. We further boost the expressive power of MV-GNN by proposing a cross-dependent message passing scheme.
  arXiv  Detail & Related papers  (2020-05-17T04:46:07Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.