Predicting ligand binding affinity using on- and off-rates for the SAMPL6 SAMPLing challenge
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Interest in ligand binding kinetics has been growing rapidly, as it is being discovered in more and more systems that ligand residence time is the crucial factor governing drug efficacy. Many enhanced sampling methods have been developed with the goal of predicting ligand binding rates ($$k_{\text {on}}$$kon) and/or ligand unbinding rates ($$k_{\text {off}}$$koff) through explicit simulation of ligand binding pathways, and these methods work by very different mechanisms. Although there is not yet a blind challenge for ligand binding kinetics, here we take advantage of experimental measurements and rigorously computed benchmarks to compare estimates of $$K_D$$KD calculated as the ratio of two rates: $$k_{\text {off}}/k_{\text {on}}$$koff/kon. These rates were determined using a new enhanced sampling method based on the weighted ensemble framework that we call “REVO”: Reweighting of Ensembles by Variance Optimization. This is a further development of the WExplore enhanced sampling method, in which trajectory cloning and merging steps are guided not by the definition of sampling regions, but by maximizing trajectory variance. Here we obtain estimates of $$k_{\text {on}}$$kon and $$k_{\text {off}}$$koff that are consistent across multiple simulations, with an average log10-scale standard deviation of 0.28 for on-rates and 0.56 for off-rates, which is well within an order of magnitude and far better than previously observed for previous applications of the WExplore algorithm. Our rank ordering of the three host–guest pairs agrees with the reference calculations, however our predicted $$\Delta G$$ΔG values were systematically lower than the reference by an average of 4.2 kcal/mol. Using tree network visualizations of the trajectories in the REVO algorithm, and conformation space networks for each system, we analyze the results of our sampling, and hypothesize sources of discrepancy between our $$K_D$$KD values and the reference. We also motivate the direct inclusion of $$k_{\text {on}}$$kon and $$k_{\text {off}}$$koff challenges in future iterations of SAMPL, to further develop the field of ligand binding kinetics prediction and modeling.
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
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 1×
“2 library [33] and visualized using Gephi 0.”
OpenMM 7: Rapid development of high performance algorithms for molecular dynamics
Eastman, P., Swails, J., Chodera, J. D., McGibbon, R. T., Zhao, Y., Beauchamp, K. A., Wang, L.-P., Simmonett, A. C., Harrigan, M. P., Stern, C. D., et al. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005659 · Cited by 2,748
Complete reconstruction of an enzyme-inhibitor binding process by molecular dynamics simulations
Buch, I., Giorgino, T., & De Fabritiis, G. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1103547108 · Cited by 655
Cited by
How Robust Is the Ligand Binding Transition State?
Bose, S., Lotz, S. D., Deb, I., Shuck, M., Lee, K. S. S., & Dickson, A. (2023) · Journal of the American Chemical Society · doi:10.1021/jacs.3c08940 · Cited by 16
Self-citationMarkov State Models with Weighted Ensemble Simulation: How to Eliminate the Trajectory Merging Bias
Bose, S., Kilinc, C., & Dickson, A. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01141 · Cited by 10
Self-citationAhn, S.-H., Ojha, A., Amaro, R., & McCammon, J. (2021) · doi:10.33774/chemrxiv-2021-2j2zr · Cited by 1
Metadata
- Authors
- Dixon, T., Lotz, S. D., & Dickson, A.
- Venue
- Journal of Computer-Aided Molecular Design
- Published
- 2018-08-23
- Volume
- 32
- Issue
- 10
- Pages
- 1001-1012
- ISSN
- 0920-654X (ISSN-L)
- 1573-4951
- OpenAlex
- W2888553603
- Cited by
- 46
- References
- 3
- FWCI
- 4.79
- Type
- journal article
- Language
- en
- Open access
- green
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: Predicting ligand binding affinity using on- and off-rates for the SAMPL6 SAMPLing challenge. https://app.cochat.ai/papers/10.1007/s10822-018-0149-3
- The paper
- Dixon, T., Lotz, S. D., & Dickson, A. (2018). Predicting ligand binding affinity using on- and off-rates for the SAMPL6 SAMPLing challenge. Journal of Computer-Aided Molecular Design. https://doi.org/10.1007/s10822-018-0149-3
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.