EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Predicting Affinity Through Homology (PATH): Interpretable binding affinity prediction with persistent homology

Yuxi Long, Bruce R Donald iD

PLOS Computational Biology · 2025

DOI: 10.1371/journal.pcbi.1013216 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS Computational Biology, 2025. Verfasst von Yuxi Long und 1 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science, Department of Mathematics, Duke University, Durham, North Carolina, United States of America. Hauptthemen laut MEDLINE: Computational Biology, Proteins. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 116 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIGMS NIH HHS, National Institute of Health.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Accurate binding affinity prediction (BAP) is crucial to structure-based drug design. We present PATH + , a novel, generalizable machine learning algorithm for BAP that exploits recent advances in computational topology. Compared to current binding affinity prediction algorithms, PATH + shows similar or better accuracy and is more generalizable across orthogonal datasets. PATH + is not only one of the most accurate algorithms for BAP, it is also the first algorithm that is inherently interpretable. Interpretability is a key factor of trust for an algorithm and alongside generalizability, which allows PATH + to be trusted in critical applications, such as inhibitor design. We visualized the features captured by PATH + for two clinically relevant protein-ligand complexes and find that PATH + captures binding-relevant structural mutations that are corroborated by biochemical data. Our work also sheds light on the features captured by current computational topology BAP algorithms that contributed to their high performance, which have been poorly understood. PATH + also offers an improvement of 𝒪 ( m + n ) 3 in computational complexity and is empirically over 10 times faster than the dominant (uninterpretable) computational topology algorithm for BAP. Based on insights from PATH + , we built PATH − , a scoring function for differentiating between binders and non-binders that has outstanding accuracy against 11 current algorithms for BAP. In summary, we report progress in a novel combination of interpretability, speed, and accuracy that should further empower topological screening of large virtual inhibitor libraries to protein targets, and allow binding affinity predictions to be understood and trusted. The source code for PATH + and PATH − is released open-source as part of the OSPREY protein design software package.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Computational BiologyProteinsAlgorithmsProtein BindingMachine LearningLigandsDrug DesignBinding SitesDatabases, ProteinHumans

Substanzen

ProteinsLigands

Autor:innen und Institutionen

  • Department of Computer Science, Department of Mathematics, Duke University, Durham, North Carolina, United States of America.
  • Department of Biochemistry, Department of Chemistry, Duke University and Duke University School of Medicine, Durham, North Carolina, United States of America.

ORCID-Profile: Bruce R Donald

Förderung

  • NIGMS NIH HHS
  • National Institute of Health

Zitieren

APA

Long, Y., & Donald, B. R. (2025). Predicting Affinity Through Homology (PATH): Interpretable binding affinity prediction with persistent homology. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1013216

Vancouver

Long Y, Donald BR. Predicting Affinity Through Homology (PATH): Interpretable binding affinity prediction with persistent homology. PLOS Computational Biology. 2025. doi:10.1371/journal.pcbi.1013216

BibTeX
@article{Long2025,
  author = {Long, Yuxi and Donald, Bruce R},
  title = {Predicting Affinity Through Homology (PATH): Interpretable binding affinity prediction with persistent homology},
  journal = {PLOS Computational Biology},
  year = {2025},
  doi = {10.1371/journal.pcbi.1013216}
}
Kostenlos starten →