GNNAS-Dock: Budget Aware Algorithm Selection with Graph Neural Networks for Molecular Docking

• URL: http://arxiv.org/abs/2411.12597v1
• Date: Tue, 19 Nov 2024 16:01:54 GMT
• Title: GNNAS-Dock: Budget Aware Algorithm Selection with Graph Neural Networks for Molecular Docking
• Authors: Yiliang Yuan, Mustafa Misir,
• Abstract summary: This paper introduces GNNASDock, a novel Graph Graph Network (GNN)-based automated algorithm selection system for molecular docking in blind docking. GNNs are accommodated to process the complex structural data of both situations and proteins. They benefit from inherent graph-like properties to predict the performance of various docking algorithms under different conditions.
• Score: 0.0
• License:
• Abstract: Molecular docking is a major element in drug discovery and design. It enables the prediction of ligand-protein interactions by simulating the binding of small molecules to proteins. Despite the availability of numerous docking algorithms, there is no single algorithm consistently outperforms the others across a diverse set of docking scenarios. This paper introduces GNNAS-Dock, a novel Graph Neural Network (GNN)-based automated algorithm selection system for molecular docking in blind docking situations. GNNs are accommodated to process the complex structural data of both ligands and proteins. They benefit from the inherent graph-like properties to predict the performance of various docking algorithms under different conditions. The present study pursues two main objectives: 1) predict the performance of each candidate docking algorithm, in terms of Root Mean Square Deviation (RMSD), thereby identifying the most accurate method for specific scenarios; and 2) choose the best computationally efficient docking algorithm for each docking case, aiming to reduce the time required for docking while maintaining high accuracy. We validate our approach on PDBBind 2020 refined set, which contains about 5,300 pairs of protein-ligand complexes.

Related papers

• Scalable Graph Compressed Convolutions [68.85227170390864]
  We propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2024-07-26T03:14:13Z)
• PLA-SGCN: Protein-Ligand Binding Affinity Prediction by Integrating Similar Pairs and Semi-supervised Graph Convolutional Network [6.024776891570197]
  This paper aims to integrate retrieved hard protein-ligand pairs in PLA prediction (i.e., task prediction step) using a semi-supervised graph convolutional network (GCN) The results show that the proposed method significantly performs better than the comparable approaches.
  arXiv  Detail & Related papers  (2024-05-13T03:27:02Z)
• Quantum molecular docking with quantum-inspired algorithm [4.959284967789063]
  We propose a novel quantum molecular docking (QMD) approach based on QA-inspired algorithm. We construct two binary encoding methods to efficiently discretize the degrees of freedom with exponentially reduced number of bits. We show that QMD has shown advantages over the search-based Auto Vina and the deep-learning DIFFDOCK in both re-docking and self-docking scenarios.
  arXiv  Detail & Related papers  (2024-04-12T06:24:45Z)
• Quantum-Inspired Machine Learning for Molecular Docking [9.16729372551085]
  Molecular docking is an important tool for structure-based drug design, accelerating the efficiency of drug development. Traditional docking by searching for possible binding sites and conformations is computationally complex and results poorly under blind docking. We introduce quantum-inspired algorithms combining quantum properties and spatial optimization problems. Our method outperforms traditional docking algorithms and deep learning-based algorithms over 10%.
  arXiv  Detail & Related papers  (2024-01-22T09:16:41Z)
• Multi-scale Iterative Refinement towards Robust and Versatile Molecular Docking [17.28573902701018]
  Molecular docking is a key computational tool utilized to predict the binding conformations of small molecules to protein targets. We introduce DeltaDock, a robust and versatile framework designed for efficient molecular docking.
  arXiv  Detail & Related papers  (2023-11-30T14:09:20Z)
• Deep Surrogate Docking: Accelerating Automated Drug Discovery with Graph Neural Networks [0.9785311158871759]
  We introduce Deep Surrogate Docking (DSD), a framework that applies deep learning-based surrogate modeling to accelerate the docking process substantially. We show that the DSD workflow combined with the FiLMv2 architecture provides a 9.496x speedup in molecule screening with a 3% recall error rate.
  arXiv  Detail & Related papers  (2022-11-04T19:36:02Z)
• Efficient Dataset Distillation Using Random Feature Approximation [109.07737733329019]
  We propose a novel algorithm that uses a random feature approximation (RFA) of the Neural Network Gaussian Process (NNGP) kernel. Our algorithm provides at least a 100-fold speedup over KIP and can run on a single GPU. Our new method, termed an RFA Distillation (RFAD), performs competitively with KIP and other dataset condensation algorithms in accuracy over a range of large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-21T15:56:13Z)
• Independent SE(3)-Equivariant Models for End-to-End Rigid Protein Docking [57.2037357017652]
  We tackle rigid body protein-protein docking, i.e., computationally predicting the 3D structure of a protein-protein complex from the individual unbound structures. We design a novel pairwise-independent SE(3)-equivariant graph matching network to predict the rotation and translation to place one of the proteins at the right docked position. Our model, named EquiDock, approximates the binding pockets and predicts the docking poses using keypoint matching and alignment.
  arXiv  Detail & Related papers  (2021-11-15T18:46:37Z)
• 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)
• Towards Efficient Graph Convolutional Networks for Point Cloud Handling [181.59146413326056]
  We aim at improving the computational efficiency of graph convolutional networks (GCNs) for learning on point clouds. A series of experiments show that optimized networks have reduced computational complexity, decreased memory consumption, and accelerated inference speed.
  arXiv  Detail & Related papers  (2021-04-12T17:59:16Z)
• Random Features for the Neural Tangent Kernel [57.132634274795066]
  We propose an efficient feature map construction of the Neural Tangent Kernel (NTK) of fully-connected ReLU network. We show that dimension of the resulting features is much smaller than other baseline feature map constructions to achieve comparable error bounds both in theory and practice.
  arXiv  Detail & Related papers  (2021-04-03T09:08:12Z)

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.