Efficient iterative virtual screening with Apache Spark and conformal prediction
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
BACKGROUND: Docking and scoring large libraries of ligands against target proteins forms the basis of structure-based virtual screening. The problem is trivially parallelizable, and calculations are generally carried out on computer clusters or on large workstations in a brute force manner, by docking and scoring all available ligands. CONTRIBUTION: In this study we propose a strategy that is based on iteratively docking a set of ligands to form a training set, training a ligand-based model on this set, and predicting the remainder of the ligands to exclude those predicted as 'low-scoring' ligands. Then, another set of ligands are docked, the model is retrained and the process is repeated until a certain model efficiency level is reached. Thereafter, the remaining ligands are docked or excluded based on this model. We use SVM and conformal prediction to deliver valid prediction intervals for ranking the predicted ligands, and Apache Spark to parallelize both the docking and the modeling. RESULTS: We show on 4 different targets that conformal prediction based virtual screening (CPVS) is able to reduce the number of docked molecules by 62.61% while retaining an accuracy for the top 30 hits of 94% on average and a speedup of 3.7. The implementation is available as open source via GitHub ( https://github.com/laeeq80/spark-cpvs ) and can be run on high-performance computers as well as on cloud resources.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Virtual screening of chemical libraries
Shoichet, B. K. (2004) · Nature · doi:10.1038/nature03197 · Cited by 1,425
Algorithmic Learning in a Random World
(2005) · doi:10.1007/b106715 · Cited by 1,119
Cited by
Sabe, V. T., Ntombela, T., Jhamba, L. A., Maguire, G. E. M., Govender, T., Naicker, T., & Kruger, H. G. (2021) · European Journal of Medicinal Chemistry · doi:10.1016/j.ejmech.2021.113705 · Cited by 625
Deep Docking: A Deep Learning Platform for Augmentation of Structure Based Drug Discovery
Gentile, F., Agrawal, V., Hsing, M., Ton, A.-T., Ban, F., Norinder, U., Gleave, M. E., & Cherkasov, A. (2020) · ACS Central Science · doi:10.1021/acscentsci.0c00229 · Cited by 447
Gentile, F., Yaacoub, J. C., Gleave, J., Fernandez, M., Ton, A.-T., Ban, F., Stern, A., & Cherkasov, A. (2022) · Nature Protocols · doi:10.1038/s41596-021-00659-2 · Cited by 397
Integrating QSAR modelling and deep learning in drug discovery: the emergence of deep QSAR
Tropsha, A., Isayev, O., Varnek, A., Schneider, G., & Cherkasov, A. (2024) · Nature Reviews Drug Discovery · doi:10.1038/s41573-023-00832-0 · Cited by 397
Accelerating high-throughput virtual screening through molecular pool-based active learning
Graff, D. E., Shakhnovich, E. I., & Coley, C. W. (2021) · Chemical Science · doi:10.1039/d0sc06805e · Cited by 302
Metadata
- Authors
- Ahmed, L., Georgiev, V., Capuccini, M., Toor, S., Schaal, W., Laure, E., & Spjuth, O.
- Venue
- Journal of Cheminformatics
- Published
- 2018-03-01
- Volume
- 10
- Issue
- 1
- Pages
- 8-8
- ISSN
- 1758-2946 (ISSN-L)
- OpenAlex
- W2789547262
- Cited by
- 41
- References
- 3
- FWCI
- 3.55
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient iterative virtual screening with Apache Spark and conformal prediction. https://app.cochat.ai/papers/10.1186/s13321-018-0265-z
- The paper
- Ahmed, L., Georgiev, V., Capuccini, M., Toor, S., Schaal, W., Laure, E., & Spjuth, O. (2018). Efficient iterative virtual screening with Apache Spark and conformal prediction. Journal of Cheminformatics. https://doi.org/10.1186/s13321-018-0265-z
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.