graphDelta: MPNN Scoring Function for the Affinity Prediction of Protein–Ligand Complexes
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
In this work, we present graph-convolutional neural networks for the prediction of binding constants of protein–ligand complexes. We derived the model using multi task learning, where the target variables are the dissociation constant (Kd), inhibition constant (Ki), and half maximal inhibitory concentration (IC50). Being rigorously trained on the PDBbind dataset, the model achieves the Pearson correlation coefficient of 0.87 and the RMSE value of 1.05 in pK units, outperforming recently developed 3D convolutional neural network model Kdeep.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Development and validation of a genetic algorithm for flexible docking 1 1Edited by F. E. Cohen
Jones, G., Willett, P., Glen, R. C., Leach, A. R., & Taylor, R. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0897 · Cited by 6,763
Generalized Neural-Network Representation of High-Dimensional Potential-Energy Surfaces
Behler, J., & Parrinello, M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.146401 · Cited by 5,010 · cited 8×
“It should be noted that in our implementation vector, h v 1 is initialized as the BPS node descriptor vector calculated to represent the atomic environment.”
InfluentialGeometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review
Rawat, W., & Wang, Z. (2017) · Neural Computation · doi:10.1162/neco_a_00990 · Cited by 3,503
Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules
Gómez-Bombarelli, R., Wei, J. N., Duvenaud, D., Hernández-Lobato, J. M., Sánchez-Lengeling, B., Sheberla, D., Aguilera-Iparraguirre, J., Hirzel, T. D., Adams, R. P., & Aspuru-Guzik, A. (2018) · ACS Central Science · doi:10.1021/acscentsci.7b00572 · Cited by 3,106
Convolutional Networks on Graphs for Learning Molecular Fingerprints
Duvenaud, D., Maclaurin, D., Aguilera-Iparraguirre, J., Gómez-Bombarelli, R., Hirzel, T., Aspuru-Guzik, A., & Adams, R. P. (2015) · arXiv · doi:10.48550/arxiv.1509.09292 · Cited by 2,628
On representing chemical environments
Bartók, A. P., Kondor, R., & Csányi, G. (2013) · Physical Review B · doi:10.1103/physrevb.87.184115 · Cited by 2,572 · cited 1×
“It is worth mentioning that Behler − Parrinello symmetric functions (BPS) 54 made a basis for the fi rst transferable NN potential and smooth overlap of atomic positions, 55 which de fi nes a similarity metric for direct comparison of atomic environments.”
BackgroundQuantum chemistry structures and properties of 134 kilo molecules
Ramakrishnan, R., Dral, P. O., Rupp, M., & von Lilienfeld, O. A. (2014) · Scientific Data · doi:10.1038/sdata.2014.22 · Cited by 1,966 · cited 1×
“44 We assess its performance on di ff erent data sets and compare it with the existing tools.”
MethodANI-1: an extensible neural network potential with DFT accuracy at force field computational cost
Smith, J. S., Isayev, O., & Roitberg, A. E. (2017) · Chemical Science · doi:10.1039/c6sc05720a · Cited by 1,921
Molecular graph convolutions: moving beyond fingerprints
Kearnes, S., McCloskey, K., Berndl, M., Pande, V., & Riley, P. (2016) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-016-9938-8 · Cited by 1,631
Quantum-chemical insights from deep tensor neural networks
Schütt, K. T., Arbabzadah, F., Chmiela, S., Müller, K. R., & Tkatchenko, A. (2017) · Nature Communications · doi:10.1038/ncomms13890 · Cited by 1,445 · cited 3×
“…with a possibility to predict binding free energy for a diverse set of chemical compounds and protein targets based on subclass of graph CNN message passing neural networks which demonstrated very promising results in approximation of DFT electron energies 28 for the QM9 small molecule data set.”
BackgroundInfluentialWang, L., Wu, Y., Deng, Y., Kim, B., Pierce, L., Krilov, G., Lupyan, D., Robinson, S., Dahlgren, M. K., Greenwood, J., et al. (2015) · Journal of the American Chemical Society · doi:10.1021/ja512751q · Cited by 1,313
Forging the basis for developing protein-ligand interaction scoring functions.
Liu, Z., Su, M., Han, L., Liu, J., Yang, Q., Li, Y., & Wang, R. (2017) · Accounts of Chemical Research · doi:10.1021/acs.accounts.6b00491 · Cited by 493
Application of Generative Autoencoder in De Novo Molecular Design
Blaschke, T., Olivecrona, M., Engkvist, O., Bajorath, J., & Chen, H. (2018) · Molecular Informatics · doi:10.1002/minf.201700123 · Cited by 411
Ain, Q. U., Aleksandrova, A., Roessler, F. D., & Ballester, P. J. (2015) · WIREs Computational Molecular Science · doi:10.1002/wcms.1225 · Cited by 357
Imbalzano, G., Anelli, A., Giofré, D., Klees, S., Behler, J., & Ceriotti, M. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5024611 · Cited by 330
Li, H., Leung, K., Wong, M., & Ballester, P. J. (2015) · Molecular Informatics · doi:10.1002/minf.201400132 · Cited by 252
Beware of machine learning-based scoring functions-on the danger of developing black boxes.
Gabel, J., Desaphy, J., & Rognan, D. (2014) · Journal of Chemical Information and Modeling · doi:10.1021/ci500406k · Cited by 143
Comparative Study of Multitask Toxicity Modeling on a Broad Chemical Space
Sosnin, S., Karlov, D., Tetko, I. V., & Fedorov, M. V. (2019) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.8b00685 · Cited by 102
Self-citation
Cited by
Dhakal, A., McKay, C., Tanner, J. J., & Cheng, J. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbab476 · Cited by 256
DeepRank-GNN: a graph neural network framework to learn patterns in protein–protein interfaces
Réau, M., Renaud, N., Xue, L. C., & Bonvin, A. M. J. J. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac759 · Cited by 190
(2024) · doi:10.1038/s42256-024-00855-1 · Cited by 57
(2023) · doi:10.3390/biom13010132 · Cited by 28
Metadata
- Authors
- Karlov, D. S., Sosnin, S., Fedorov, M. V., & Popov, P.
- Venue
- ACS Omega
- Publisher
- American Chemical Society (ACS)
- Published
- 2020-03-09
- Volume
- 5
- Issue
- 10
- Pages
- 5150-5159
- ISSN
- 2470-1343 (ISSN-L)
- OpenAlex
- W3009499476
- Cited by
- 98
- References
- 20
- FWCI
- 6.07
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.