PandaDock’s empirical scoring function ranks 8th of 25 methods evaluated, ahead of every AutoDock Vina and Vinardo configuration tested, while the GNN scores below Vina, consistent with the within-target ceiling identified on SAIR.
Abstract
We present PandaDock, an open-source molecular docking platform implementing flexible-ligand conformational search with analytic gradients, a precomputed affinity grid engine, specialized modules for induced-fit, metal-coordination and tethered docking, and an SE(3)-equivariant graph neural network scoring function trained at scale. Ligand flexibility is represented as a torsion tree and pose parameters are optimized by Monte Carlo with Metropolis acceptance refined by L-BFGS, with rotational gradients obtained in closed form through the derivative of the SO(3) exponential map rather than by finite differences. Affinity grids are built by a blocked neighbor-selection scheme that is exact and 5.6–9.7× faster than dense evaluation, and may be cached across ligands sharing a receptor and site, reducing a six-ligand series from 29.3 s to 10.4 s. On 814 protein–ligand complexes spanning 14 target families, PandaDock recovers a pose within 2 Å of the crystal geometry in 33.7% of cases at rank 1 and in 57.0% of cases within the returned ensemble. The GNN scoring function is trained on 741,706 co-folded complexes from SAIR under target-disjoint splits, reaching a Pearson r of 0.407 on 90,219 held-out complexes and transferring to 202 independent crystal structures with measured Ki, Kd, IC50 or EC50 at r = 0.467. We report the model against three controls, a target-mean predictor, a ligand-descriptor-only baseline, and within-target correlations, and document both where it performs and where it does not, including its unsuitability for pose rescoring. On an independent 30-compound series against a single GABAA receptor target, PandaDock’s empirical scoring function ranks 8th of 25 methods evaluated, ahead of every AutoDock Vina and Vinardo configuration tested, while the GNN scores below Vina, consistent with the within-target ceiling identified on SAIR. At full scale on the PDBbind v2020 refined set (n = 4,640, native crystal poses), the fully independent SAIR model reaches r = 0.531, and a dedicated model trained on PDBbind alone under a target-disjoint split reaches r = 0.690 on its own held-out test complexes – the strongest evidence in this work that PandaDock’s affinity predictions generalize. PandaDock is distributed under an open-source license at https://github.com/pritampanda15/PandaDock with a complete command-line interface and a reproducible benchmarking harness.
This work introduces Evolutionary Driven Bayesian Optimization (EA-BO), a surrogate-based framework designed for efficient exploration under strict evaluation budgets and demonstrates that EA-BO provides data-efficient strategy for locating promising docking regions when computational cost limit traditional approaches.
A. Lopez-Rincon, B. Varga, D. Rojas-Velazquez et al.· Annual Conference on Genetic...· 0 citations
An enhanced local optimization strategy based on curved line search (CLS) is introduced and integrated into AutoDock Vina, resulting in Vina_CLS, demonstrating that improved local optimization can substantially enhance docking performance.
Leo Gaskin, Matthias Welsch, J. Kirchmair et al.· Journal of Chemical Theory a...· 0 citations
A category-stratified, statistically powered benchmark comparing pose prediction from receptor conformational ensembles against AlphaFold2, used as a matched static-structure baseline, across 29 protein–ligand systems spanning cryptic-pocket, induced-fit, water-mediated, and autoimmune-indication target classes is pres...
Ryan Varghese, Pooja Tiwary, Krishil Oswal· bioRxiv· 0 citations
This work proposes a method to compute accurate kinetics for general ligand-unbinding problems at modest computational expense and minimal fine tuning, building on the AIMMD path sampling framework and opting for modelling the committor with a single descriptor-free, equivariant graph neural network shared across all s...
SMASH is presented, which features several upgrades: it predicts binding sites using machine learning, automatically determines titration states, utilizes a Graphics Process Unit for molecular docking, combines machine learning with energy scoring functions, and clusters data using the K-means algorithm.
A. Suárez-Alonso, L. D. Herrera-Zúñiga, Mayra Lozano-Espinosa et al.· Journal of Molecular Modelin...· 0 citations
The results demonstrate that GROMACS-GaMD provides a practical, GPU-enabled, collective-variable-free enhanced-sampling framework for biomolecular free-energy calculations, protein folding, and ligand-binding studies.
Yuefeng Yang· bioRxiv· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.
MIT News · Artificial Intelligence· news.mit.eduJul 15, 2026
Assistant Professor Pat Pataranutaporn describes a new interface that lets everyday users glimpse inside an AI's neural network before their chatbot ever says a word.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.