Machine‐learning scoring functions for structure‐based drug lead optimization
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Molecular docking can be used to predict how strongly small‐molecule binders and their chemical derivatives bind to a macromolecular target using its available three‐dimensional structures. Scoring functions (SFs) are employed to rank these molecules by their predicted binding affinity (potency). A classical SF assumes a predetermined theory‐inspired functional form for the relationship between the features characterizing the structure of the protein–ligand complex and its predicted binding affinity (this relationship is almost always assumed to be linear). Recent years have seen the prosperity of machine‐learning SFs, which are fast regression models built instead with contemporary supervised learning algorithms. In this review, we analyzed machine‐learning SFs for drug lead optimization in the 2015–2019 period. The performance gap between classical and machine‐learning SFs was large and has now broadened owing to methodological improvements and the availability of more training data. Against the expectations of many experts, SFs employing deep learning techniques were not always more predictive than those based on more established machine learning techniques and, when they were, the performance gain was small. More codes and webservers are available and ready to be applied to prospective structure‐based drug lead optimization studies. These have exhibited excellent predictive accuracy in compelling retrospective tests, outperforming in some cases much more computationally demanding molecular simulation‐based methods. A discussion of future work completes this review. This article is categorized under: Computer and Information Science > Chemoinformatics
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
Trott, O., & Olson, A. J. (2010) · Journal of Computational Chemistry · doi:10.1002/jcc.21334 · Cited by 38,412
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
MoleculeNet: a benchmark for molecular machine learning
Wu, Z., Ramsundar, B., Feinberg, E. N., Gomes, J., Geniesse, C., Pappu, A. S., Leswing, K., & Pande, V. (2018) · Chemical Science · doi:10.1039/c7sc02664a · Cited by 3,107
Wang, 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 · cited 1×
“On several targets, these authors demonstrated that DeltaDelta NN was even more predictive than a far slower physics-based free energy perturbation (FEP) simulation method.(98) Community blind tests have also been carried out to assess the SBLO ability of a range of in silico methods.”
BackgroundFrom machine learning to deep learning: progress in machine intelligence for rational drug discovery
Zhang, L., Tan, J., Han, D., & Zhu, H. (2017) · Drug Discovery Today · doi:10.1016/j.drudis.2017.08.010 · Cited by 760 · cited 1×
“15 Reviews have also been presented about the application of ML to quantitative structure – activity relationship (QSAR) modeling 21 as well as proteochemometric modeling.”
MethodPerformance of machine-learning scoring functions in structure-based virtual screening.
Wójcikowski, M., Ballester, P. J., & Siedlecki, P. (2017) · Scientific Reports · doi:10.1038/srep46710 · Cited by 364
Self-citationAin, Q. U., Aleksandrova, A., Roessler, F. D., & Ballester, P. J. (2015) · WIREs Computational Molecular Science · doi:10.1002/wcms.1225 · Cited by 357
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
Cited by
Use of molecular docking computational tools in drug discovery
(2021) · Progress in Medicinal Chemistry · doi:10.1016/bs.pmch.2021.01.004 · Cited by 621
Machine-learning methods for ligand–protein molecular docking
Crampon, K., Giorkallos, A., Deldossi, M., Baud, S., & Steffenel, L. A. (2022) · Drug Discovery Today · doi:10.1016/j.drudis.2021.09.007 · Cited by 388
Francoeur, P. G., Masuda, T., Sunseri, J., Jia, A., Iovanisci, R. B., Snyder, I., & Koes, D. R. (2020) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.0c00411 · Cited by 343
Accelerating antibiotic discovery through artificial intelligence
Melo, M. C. R., Maasch, J. R. M. A., & de la Fuente-Nunez, C. (2021) · Communications Biology · doi:10.1038/s42003-021-02586-0 · Cited by 234
Artificial Intelligence and the Future of Diagnostic and Therapeutic Radiopharmaceutical Development
Ataeinia, B., & Heidari, P. (2021) · PET Clinics · doi:10.1016/j.cpet.2021.06.008 · Cited by 31
DockOpt: A Tool for Automatic Optimization of Docking Models
(2024) · doi:10.1021/acs.jcim.3c01406 · Cited by 7
Metadata
- Authors
- Li, H., Sze, K., Lu, G., & Ballester, P. J.
- Venue
- WIREs Computational Molecular Science
- Publisher
- Wiley
- Published
- 2020-02-05
- Volume
- 10
- Issue
- 5
- ISSN
- 1759-0876 (ISSN-L)
- 1759-0884
- OpenAlex
- W3005417975
- Cited by
- 148
- References
- 18
- FWCI
- 11.43
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.