Update README_mcpp-dataset.md
Browse files- README_mcpp-dataset.md +36 -15
README_mcpp-dataset.md
CHANGED
|
@@ -1,23 +1,44 @@
|
|
| 1 |
-
Unified
|
| 2 |
|
| 3 |
-
|
| 4 |
-
of 186,685 MCP–protein complexes. (mcpp_dataset.tar.gz). Our strategy consists of randomly mutating the MCPs at 1 to 8 different sites,
|
| 5 |
-
using a list of 213 distinct amino acids. We relaxing them using fast-relax in Rosetta, which involves iterative cycles of side-chain
|
| 6 |
-
packing and all-atom minimization. Then, we selected the best mutated complexes based on the lowest interface scores. The source dataset comprises
|
| 7 |
-
lengths ranging from 4 to 25 amino acids with an average of 10. 78% of the MCPs contain one or more non-canonical amino acids, i.e. any amino acid
|
| 8 |
-
that is neither L-canonical nor D-canonical. We split the dataset into train (train_data.pt), test (test_data.pt) and validation (val_data.pt)
|
| 9 |
-
subsets using a clustering approach creating a test set consisting of 100 protein pockets.
|
| 10 |
|
|
|
|
| 11 |
|
|
|
|
|
|
|
| 12 |
|
| 13 |
-
|
|
|
|
| 14 |
|
| 15 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 16 |
|
| 17 |
-
|
| 18 |
-
test set
|
| 19 |
-
train set: train_data.pt
|
| 20 |
-
validation set: val_data.pt
|
| 21 |
|
| 22 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 23 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Unified All-Atom Molecule Generation with Neural Fields — MCPP Dataset
|
| 2 |
|
| 3 |
+
We curated a dataset of **186,685 MCP–protein complexes** (`mcpp_dataset.tar.gz`) starting from **641 protein–MCP complexes** from the **[RCSB PDB](https://www.rcsb.org/)** using a **“mutate-then-relax”** strategy:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 4 |
|
| 5 |
+
## Dataset Generation Pipeline
|
| 6 |
|
| 7 |
+
1. **Mutation:**
|
| 8 |
+
MCPs were randomly mutated at **1 to 8 sites** using **213 distinct amino acids**.
|
| 9 |
|
| 10 |
+
2. **Relaxation:**
|
| 11 |
+
Mutated complexes were relaxed using **FastRelax in Rosetta**, which iteratively performs side-chain packing and all-atom minimization.
|
| 12 |
|
| 13 |
+
3. **Selection:**
|
| 14 |
+
The best complexes were chosen based on **lowest interface scores**.
|
| 15 |
+
|
| 16 |
+
---
|
| 17 |
+
|
| 18 |
+
## Dataset Statistics
|
| 19 |
+
- MCP lengths: **4–25 amino acids** (average 10)
|
| 20 |
+
- **78%** of MCPs contain one or more **non-canonical amino acids**
|
| 21 |
+
|
| 22 |
+
---
|
| 23 |
|
| 24 |
+
## Dataset Splits
|
| 25 |
+
The dataset is split using a clustering-based approach. The **test set** covers **100 protein pockets**:
|
|
|
|
|
|
|
| 26 |
|
| 27 |
+
| Split | File |
|
| 28 |
+
|---------------|----------------|
|
| 29 |
+
| Training set | `train_data.pt` |
|
| 30 |
+
| Validation set| `val_data.pt` |
|
| 31 |
+
| Test set | `test_data.pt` |
|
| 32 |
|
| 33 |
+
---
|
| 34 |
+
|
| 35 |
+
## How to Use
|
| 36 |
+
|
| 37 |
+
1. **Download and extract:**
|
| 38 |
+
```bash
|
| 39 |
+
tar -xvzf mcpp_dataset.tar.gz
|
| 40 |
+
```
|
| 41 |
+
2. **To generate MCP samples with Funcbind, :**
|
| 42 |
+
```bash
|
| 43 |
+
cp train_data.pt val_data.pt test_data.pt mcpp_dataset/
|
| 44 |
+
```
|