Proximity Graph Networks: Predicting Ligand Affinity with Message Passing Neural Networks

8Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Message passing neural networks (MPNNs) on molecular graphs generate continuous and differentiable encodings of small molecules with state-of-the-art performance on protein-ligand complex scoring tasks. Here, we describe the proximity graph network (PGN) package, an open-source toolkit that constructs ligand-receptor graphs based on atom proximity and allows users to rapidly apply and evaluate MPNN architectures for a broad range of tasks. We demonstrate the utility of PGN by introducing benchmarks for affinity and docking score prediction tasks. Graph networks generalize better than fingerprint-based models and perform strongly for the docking score prediction task. Overall, MPNNs with proximity graph data structures augment the prediction of ligand-receptor complex properties when ligand-receptor data are available.

Cite

CITATION STYLE

APA

Gale-Day, Z. J., Shub, L., Chuang, K. V., & Keiser, M. J. (2024). Proximity Graph Networks: Predicting Ligand Affinity with Message Passing Neural Networks. Journal of Chemical Information and Modeling, 64(14), 5439–5450. https://doi.org/10.1021/acs.jcim.4c00311

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free