The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Machine learning classification can reduce false positives in structure-based virtual screening
Open accessAbstract
Significance: Many potential drug targets have been identified, but development of chemical probes to validate these targets has lagged behind. Computational screening holds promise for providing chemical tools to do so but has long been plagued by high false-positive rates: Many compounds ranked highly against a given target protein do not actually show activity. Machine learning approaches have not solved this problem, which we hypothesize is because models were not trained on sufficiently compelling “decoys.” By addressing this through a unique training strategy, we show that more effective virtual screening is attainable. We expect this insight to enable improved performance across diverse virtual screening pipelines, thus helping to provide chemical probes for new potential drug targets as they are discovered.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
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
Yung-Chi, C., & Prusoff, W. H. (1973) · Biochemical Pharmacology · doi:10.1016/0006-2952(73)90196-2 · Cited by 12,922
Friesner, R. A., Banks, J. L., Murphy, R. B., Halgren, T. A., Klicic, J. J., Mainz, D. T., Repasky, M. P., Knoll, E. H., Shelley, M., Perry, J. K., et al. (2004) · Journal of Medicinal Chemistry · doi:10.1021/jm0306430 · Cited by 10,057
Molecular properties that influence the oral bioavailability of drug candidates
Veber, D. F., Johnson, S. R., Cheng, H.-Y., Smith, B. R., Ward, K. W., & Kopple, K. D. (2002) · Journal of Medicinal Chemistry · doi:10.1021/jm020017n · Cited by 8,420 · cited 1×
“At the time of our screen, this library was comprised of 732 million chemical entities that conform to historic criteria for drug-likeness (71, 72).”
Vogelstein, B., Papadopoulos, N., Velculescu, V. E., Zhou, S., Diaz, L. A., & Kinzler, K. W. (2013) · Science · doi:10.1126/science.1235122 · Cited by 7,863
ZINC − A Free Database of Commercially Available Compounds for Virtual Screening
Irwin, J. J., & Shoichet, B. K. (2005) · Journal of Chemical Information and Modeling · doi:10.1021/ci049714+ · Cited by 4,058
Gradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887 · cited 1×
“We considered a total of eight classification algorithms in this study, using the Python implementations of each: Gradient Boosting (GB) (97), Extreme Gradient Boosting (XGB) (98), Random Forest (RF) (99), Extremely Randomized Trees (ET) (100), Gaussian Naïve Bayes (GNB) (101), k-Nearest Neighbor (kNN) (101), Linear D…”
ZINC 15 – Ligand Discovery for Everyone
Sterling, T., & Irwin, J. J. (2015) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.5b00559 · Cited by 3,224
Cited by
Challenges and advances in clinical applications of mesenchymal stromal cells
Zhou, T., Yuan, Z., Weng, J., Pei, D., Du, X., He, C., & Lai, P. (2021) · Journal of Hematology & Oncology · doi:10.1186/s13045-021-01037-x · Cited by 712
A practical guide to large-scale docking
Bender, B. J., Gahbauer, S., Luttens, A., Lyu, J., Webb, C. M., Stein, R. M., Fink, E. A., Balius, T. E., Carlsson, J., Irwin, J. J., et al. (2021) · Nature Protocols · doi:10.1038/s41596-021-00597-z · Cited by 546
The Art and Science of Molecular Docking
Paggi, J. M., Pandit, A., & Dror, R. O. (2024) · Annual Review of Biochemistry · doi:10.1146/annurev-biochem-030222-120000 · Cited by 459
Benchmarking AlphaFold‐enabled molecular docking predictions for antibiotic discovery
Wong, F., Krishnan, A., Zheng, E. J., Stärk, H., Manson, A. L., Earl, A. M., Jaakkola, T., & Collins, J. J. (2022) · Molecular Systems Biology · doi:10.15252/msb.202211081 · Cited by 284
“As computational docking approaches are known to predict many false positives (Adeshina et al , 2020), the predicted protein-ligand interactions could be experimentally interrogated, in part, using biochemical assays that measure enzymatic activity, with binding interactions supported by enzymatic…”
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
Cao, D., Chen, M., Zhang, R., Wang, Z., Huang, M., Yu, J., Jiang, X., Fan, Z., Zhang, W., Zhou, H., et al. (2025) · Nature Methods · doi:10.1038/s41592-024-02516-y · Cited by 106
Discovering small-molecule senolytics with deep neural networks
Wong, F., Omori, S., Donghia, N. M., Zheng, E. J., & Collins, J. J. (2023) · Nature Aging · doi:10.1038/s43587-023-00415-z · Cited by 82
FRAGSITE: A Fragment-Based Approach for Virtual Ligand Screening
Zhou, H., Cao, H., & Skolnick, J. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.0c01160 · Cited by 32
Ferraz, M. V. F., Neto, J. C. S., Lins, R. D., & Teixeira, E. S. (2023) · Physical Chemistry Chemical Physics · doi:10.1039/d2cp05644e · Cited by 9
(2026) · doi:10.7554/elife.98179.2 · Cited by 8
Using Stochastic Computing for Virtual Screening Acceleration
Frasser, C. F., de Benito, C., Skibinsky-Gitlin, E. S., Canals, V., Font-Rosselló, J., Roca, M., Ballester, P. J., & Rosselló, J. L. (2021) · Electronics · doi:10.3390/electronics10232981 · Cited by 3
Metadata
- Authors
- Adeshina, Y. O., Deeds, E. J., & Karanicolas, J.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2020-07-15
- Volume
- 117
- Issue
- 31
- Pages
- 18477-18488
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W3043660595
- Cited by
- 223
- References
- 20
- FWCI
- 13.10
- 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.