Machine learning-driven prediction of substrates for enzymes introducing or removing protein post-translational modifications
Bibliographic record
Abstract
The exploration of post-translational modifications (PTMs) within the proteome is pivotal for advancing our understanding of disease and the function of cancer therapeutics. However, identifying genuine sites of PTMs introduced or removed by an enzyme of interest amid numerous candidates is challenging. We present a machine learning (ML)-driven search method, which combines ML with enzyme-mediated modification of complex peptide arrays to predict unexplored PTM sites for an enzyme of interest. Experimental validation confirmed that this approach correctly predicted 37-43% of proposed PTM sites, unveiling candidate sites of the methyltransferase SET8 and the deacetylases SIRT1-7. Our approach marks an important performance increase over traditional in vitro methods across separate enzyme classes. Mass spectrometry analysis confirmed the dynamic methylation status of several predicted SET8 substrates, and the deacetylation of 64 unique sites identified for SIRT2. This method has also revealed changes in SET8-regulated substrate network among breast cancer missense mutations, collectively revealing insight into differential enzyme function in disease. By disentangling the substrate features that dictate PTM-inducing enzyme specificity, this approach demonstrates potential in uncovering enzyme-substrate networks within PTM pathways. Understanding post-translational modifications (PTMs) is crucial for advancing disease research and cancer therapeutics, yet identifying specific enzyme-induced PTM sites remains challenging. Here, the authors introduce a machine learning-driven method combined with high-throughput peptide array synthesis, significantly enhancing PTM site prediction accuracy and revealing insights into enzyme-substrate networks, with implications for cancer research.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".