Safetensors
DFrolova commited on
Commit
dbd4e26
·
verified ·
1 Parent(s): 4519813

Update Readme.md

Browse files
Files changed (1) hide show
  1. README.md +2 -9
README.md CHANGED
@@ -1,22 +1,15 @@
1
  ---
2
- license: cc-by-4.0
3
- pipeline_tag: OTHER
4
- tags:
5
- - molecular-docking
6
- - drug-design
7
- - flow-matching
8
  ---
9
 
10
  # Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking
11
 
12
  This is a model card for the Matcha docking model introduced in the paper [Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking](https://huggingface.co/papers/2510.14586).
13
- It has 9M parameters.
14
-
15
  It can be loaded using the [Matcha repository](https://github.com/LigandPro/Matcha), where all the instructions are provided.
16
  You need to download the `pipeline` folder from the Files and versions tab.
17
 
18
  ## Abstract
19
- 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 learned scoring and physical validity filtering. Our approach consists of three sequential stages applied consecutively to 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 a dedicated scoring model and apply unsupervised physical validity filters to eliminate unrealistic poses. Compared to various approaches, Matcha demonstrates superior performance on Astex and PDBbind test sets in terms of docking success rate and physical plausibility. Moreover, our method works approximately 25 times faster than modern large-scale co-folding models.
20
 
21
  ## Overview
22
  Matcha is a molecular docking pipeline that combines multi-stage flow matching with learned scoring and physical validity filtering. 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 (R^3, SO(3), and SO(2)).
 
1
  ---
2
+ license: cc-by-nc-4.0
 
 
 
 
 
3
  ---
4
 
5
  # Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking
6
 
7
  This is a model card for the Matcha docking model introduced in the paper [Matcha: Multi-Stage Riemannian Flow Matching for Accurate and Physically Valid Molecular Docking](https://huggingface.co/papers/2510.14586).
 
 
8
  It can be loaded using the [Matcha repository](https://github.com/LigandPro/Matcha), where all the instructions are provided.
9
  You need to download the `pipeline` folder from the Files and versions tab.
10
 
11
  ## Abstract
12
+ 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 learned scoring and physical validity filtering. Our approach consists of three sequential stages applied consecutively to refine docking predictions, each implemented as a flow matching model operating on appropriate geometric spaces (R^3, SO(3), and SO(2)). We enhance the prediction quality through a dedicated scoring model and apply unsupervised physical validity filters to eliminate unrealistic poses. Compared to various approaches, Matcha demonstrates superior performance on Astex and PDBbind test sets in terms of docking success rate and physical plausibility. Moreover, our method works approximately 25 times faster than modern large-scale co-folding models.
13
 
14
  ## Overview
15
  Matcha is a molecular docking pipeline that combines multi-stage flow matching with learned scoring and physical validity filtering. 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 (R^3, SO(3), and SO(2)).