EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

DDMut-PPI: predicting effects of mutations on protein–protein interactions using graph-based deep learning

Yunzhuo Zhou, YooChan Myung, Carlos H M Rodrigues, David B Ascher iD

Nucleic Acids Research · 05.07.2024 · 52 (W1) · W207-W214

DOI: 10.1093/nar/gkae412 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Nucleic Acids Research, online erschienen am 23.05.2024. Verfasst von Yunzhuo Zhou und 3 weiteren Autor:innen. Beteiligte Einrichtung: The Australian Centre for Ecogenomics, School of Chemistry and Molecular Biosciences, University of Queensland, St Lucia, Queensland 4072, Australia. Hauptthemen laut MEDLINE: Deep Learning, Protein Interaction Mapping. Die Arbeit wurde bisher 71-mal zitiert (Crossref) und nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Australian Government, National Health and Medical Research Council, Victorian Government.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Protein–protein interactions (PPIs) play a vital role in cellular functions and are essential for therapeutic development and understanding diseases. However, current predictive tools often struggle to balance efficiency and precision in predicting the effects of mutations on these complex interactions. To address this, we present DDMut-PPI, a deep learning model that efficiently and accurately predicts changes in PPI binding free energy upon single and multiple point mutations. Building on the robust Siamese network architecture with graph-based signatures from our prior work, DDMut, the DDMut-PPI model was enhanced with a graph convolutional network operated on the protein interaction interface. We used residue-specific embeddings from ProtT5 protein language model as node features, and a variety of molecular interactions as edge features. By integrating evolutionary context with spatial information, this framework enables DDMut-PPI to achieve a robust Pearson correlation of up to 0.75 (root mean squared error: 1.33 kcal/mol) in our evaluations, outperforming most existing methods. Importantly, the model demonstrated consistent performance across mutations that increase or decrease binding affinity. DDMut-PPI offers a significant advancement in the field and will serve as a valuable tool for researchers probing the complexities of protein interactions. DDMut-PPI is freely available as a web server and an application programming interface at https://biosig.lab.uq.edu.au/ddmut_ppi.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Deep LearningProtein Interaction MappingProtein BindingMutationSoftwareProtein Interaction MapsHumansProteinsPoint Mutation

Substanzen

Proteins

Autor:innen und Institutionen

  • The Australian Centre for Ecogenomics, School of Chemistry and Molecular Biosciences, University of Queensland, St Lucia, Queensland 4072, Australia.
  • Computational Biology and Clinical Informatics, Baker Heart and Diabetes Institute, Melbourne, Victoria 3004, Australia.

ORCID-Profile: David B Ascher

Förderung

  • Australian Government
  • National Health and Medical Research Council
  • Victorian Government

Zitieren

APA

Zhou, Y., Myung, Y., Rodrigues, C. H. M., & Ascher, D. B. (2024). DDMut-PPI: predicting effects of mutations on protein–protein interactions using graph-based deep learning. Nucleic Acids Research, 52(W1), W207-W214. https://doi.org/10.1093/nar/gkae412

Vancouver

Zhou Y, Myung Y, Rodrigues CHM, Ascher DB. DDMut-PPI: predicting effects of mutations on protein–protein interactions using graph-based deep learning. Nucleic Acids Research. 2024;52(W1):W207-W214. doi:10.1093/nar/gkae412

BibTeX
@article{Zhou2024,
  author = {Zhou, Yunzhuo and Myung, YooChan and Rodrigues, Carlos H M and Ascher, David B},
  title = {DDMut-PPI: predicting effects of mutations on protein–protein interactions using graph-based deep learning},
  journal = {Nucleic Acids Research},
  year = {2024},
  volume = {52},
  number = {W1},
  pages = {W207--W214},
  doi = {10.1093/nar/gkae412}
}
Kostenlos starten →