Searcharxiv⌕ Search

arXiv subjects

Sergei A. Nikolenko

Publications and source records attributed to Sergei A. Nikolenko.

2 recordsLinked to original sources

HEDGEHOG: Hierarchical Evaluation of Drug Generators Through Rigorous Filtration

Generative molecular models can support early drug discovery by proposing new candidate compounds de novo. In practice, useful candidates must balance target-relevant activity, physicochemical properties, and other multiparameter design constraints. However, standard metrics commonly used to evaluate molecular generators only weakly reflect whether the generated compounds are medicinally plausible and suitable for downstream computation. This can produce an incomplete view of model performance and inefficient use of computational resources. We introduce HEDGEHOG, a unified six-stage filtration benchmark that is constructed as a hit identification workflow: (i) preprocessing; (ii) physicochemical descriptor screening; (iii) structural alerts and graph-sanity checks; (iv) synthesis feasibility; (v) docking; and (vi) three-dimensional pose and interaction checks. We evaluated 22 generative models in a KRAS G12D case study, using three runs of 1,000 requested generation attempts per model. The models showed different patterns of attrition, and final survival ranged from 0 to 127 molecules per run. None of the standard metrics showed a significant association with final survival after correction for multiple testing. HEDGEHOG provides a reproducible benchmark for evaluating molecular generative models by measuring molecule survival through chemical filters. The framework identifies stage-wise failure modes across generator classes and provides a practical basis for developing molecular generators better aligned with early drug discovery.

cs.LG↗

Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking

Accurate prediction of protein-ligand binding poses is crucial for structure-based drug design, yet existing methods struggle to balance speed, accuracy, and physical plausibility. We introduce Matcha, a novel molecular docking pipeline that combines multi-stage flow matching with physically-aware post-processing. Our approach consists of three sequential stages applied consecutively to progressively refine docking predictions, each implemented as a flow matching model operating on appropriate geometric spaces ($\mathbb{R}^3$, $\mathrm{SO}(3)$, and $\mathrm{SO}(2)$). We enhance the prediction quality through GNINA energy minimization and apply unsupervised physical validity filters to eliminate unrealistic poses. Compared to various approaches, Matcha demonstrates superior physical plausibility across all considered benchmarks. Moreover, our method works approximately 31 times faster than modern large-scale co-folding models. The model weights and inference code to reproduce our results are available at https://github.com/LigandPro/Matcha.

cs.LG↗