Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910013270786048 |
|---|---|
| author | Frolova, Daria Daulbaev, Talgat Sevriugov, Egor Nikolenko, Sergei A. Ivankov, Dmitry N. Oseledets, Ivan Pak, Marina A. |
| author_facet | Frolova, Daria Daulbaev, Talgat Sevriugov, Egor Nikolenko, Sergei A. Ivankov, Dmitry N. Oseledets, Ivan Pak, Marina A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_14586 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking Frolova, Daria Daulbaev, Talgat Sevriugov, Egor Nikolenko, Sergei A. Ivankov, Dmitry N. Oseledets, Ivan Pak, Marina A. Machine Learning 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. |
| title | Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2510.14586 |