GNNAS-Dock: Budget Aware Algorithm Selection with Graph Neural Networks for Molecular Docking
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Blind DockingDrug DiscoveryGraph Neural NetworkMolecular DockingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
MC-GNNAS-Dock: Multi-criteria GNN-based Algorithm Selection for Molecular Docking
Molecular docking is a core tool in drug discovery for predicting ligand-target interactions. Despite the availability of diverse search-based and machine learning approaches, no single docking algorithm consistently dom…
Drug DiscoveryMolecular Embedding-Based Algorithm Selection in Protein-Ligand Docking
Selecting an effective docking algorithm is highly context-dependent, and no single method performs reliably across structural, chemical, and protocol regimes. MolAS is a lightweight algorithm-selection model that predic…
Automatic hyperparameter selection in Autodock
Autodock is a widely used molecular modeling tool which predicts how small molecules bind to a receptor of known 3D structure. The current version of AutoDock uses meta-heuristic algorithms in combination with local sear…
Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learning
Gradient based meta-learning methods are prone to overfit on the meta-training set, and this behaviour is more prominent with large and complex networks. Moreover, large networks restrict the application of meta-learning…
Meta-LearningLearning-Based Client Selection for Federated Learning Services Over Wireless Networks with Constrained Monetary Budgets
We investigate a data quality-aware dynamic client selection problem for multiple federated learning (FL) services in a wireless network, where each client offers dynamic datasets for the simultaneous training of multipl…
Deep Reinforcement LearningFederated Learningreinforcement-learningReinforcement Learning (RL)