The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
Abstract
Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the estimation of the strength of protein–ligand interaction. Because millions of compounds must be screened, before a suitable target for biological testing can be identified, all calculations should be done in a reasonable time frame. Thus, all programs currently in use exploit empirically based algorithms, avoiding systematic search of the conformational space. Similarly, the scoring is done using simple equations, which makes it possible to speed up the entire process. Therefore, docking results have to be verified by subsequent in vitro studies. The purpose of our work was to evaluate seven popular docking programs (Surflex, LigandFit, Glide, GOLD, FlexX, eHiTS, and AutoDock) on the extensive dataset composed of 1300 protein–ligands complexes from PDBbind 2007 database, where experimentally measured binding affinity values were also available. We compared independently the ability of proper posing [according to Root mean square deviation (or Root mean square distance) of predicted conformations versus the corresponding native one] and scoring (by calculating the correlation between docking score and ligand binding strength). To our knowledge, it is the first large‐scale docking evaluation that covers both aspects of docking programs, that is, predicting ligand conformation and calculating the strength of its binding. More than 1000 protein–ligand pairs cover a wide range of different protein families and inhibitor classes. Our results clearly showed that the ligand binding conformation could be identified in most cases by using the existing software, yet we still observed the lack of universal scoring function for all types of molecules and protein families. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2011
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
Cd-hit: a fast program for clustering and comparing large sets of protein or nucleotide sequences
Li, W., & Godzik, A. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl158 · Cited by 11,410
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
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436
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
Jorgensen, W. L., & Tirado-Rives, J. (1988) · Journal of the American Chemical Society · doi:10.1021/ja00214a001 · Cited by 4,997
A Fast Flexible Docking Method using an Incremental Construction Algorithm
Rarey, M., Kramer, B., Lengauer, T., & Klebe, G. (1996) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0477 · Cited by 2,827
Berman, H. M., Battistuz, T., Bhat, T. N., Bluhm, W. F., Bourne, P. E., Burkhardt, K., Feng, Z., Gilliland, G. L., Iype, L., Jain, S., et al. (2002) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444902003451 · Cited by 2,577
Abagyan, R., Totrov, M., & Kuznetsov, D. (1994) · Journal of Computational Chemistry · doi:10.1002/jcc.540150503 · Cited by 1,699
Eldridge, M. D., Murray, C. W., Auton, T. R., Paolini, G. V., & Mee, R. P. (1997) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1007996124545 · Cited by 1,686
Wu, G., Robertson, D. H., Brooks, C. L., & Vieth, M. (2003) · Journal of Computational Chemistry · doi:10.1002/jcc.10306 · Cited by 1,566
Cited by
Molecular Docking: A Powerful Approach for Structure-Based Drug Discovery
Meng, X.-Y., Zhang, H.-X., Mezei, M., & Cui, M. (2011) · Current Computer Aided-Drug Design · doi:10.2174/157340911795677602 · Cited by 3,771
Wang, E., Sun, H., Wang, J., Wang, Z., Liu, H., Zhang, J. Z. H., & Hou, T. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00055 · Cited by 2,232
Software for molecular docking: a review
Pagadala, N. S., Syed, K., & Tuszynski, J. (2017) · Biophysical Reviews · doi:10.1007/s12551-016-0247-1 · Cited by 1,522
Key Topics in Molecular Docking for Drug Design
Torres, P. H. M., Sodero, A. C. R., Jofily, P., & Silva-Jr, F. P. (2019) · International Journal of Molecular Sciences · doi:10.3390/ijms20184574 · Cited by 641
Hsin, K.-Y., Ghosh, S., & Kitano, H. (2013) · PLoS ONE · doi:10.1371/journal.pone.0083922 · Cited by 606
Receptor–ligand molecular docking
Guedes, I. A., de Magalhães, C. S., & Dardenne, L. E. (2014) · Biophysical Reviews · doi:10.1007/s12551-013-0130-2 · Cited by 606
Buttenschoen, M., Morris, G. M., & Deane, C. M. (2024) · Chemical Science · doi:10.1039/d3sc04185a · Cited by 400
Currin, A., Swainston, N., Day, P. J., & Kell, D. B. (2015) · Chemical Society Reviews · doi:10.1039/c4cs00351a · Cited by 388
Li, Y., Han, L., Liu, Z., & Wang, R. (2014) · Journal of Chemical Information and Modeling · doi:10.1021/ci500081m · Cited by 382
Latest developments in molecular docking: 2010–2011 in review
Yuriev, E., & Ramsland, P. A. (2013) · Journal of Molecular Recognition · doi:10.1002/jmr.2266 · Cited by 344
Improving scoring-docking-screening powers of protein-ligand scoring functions using random forest
Wang, C., & Zhang, Y. (2017) · Journal of Computational Chemistry · doi:10.1002/jcc.24667 · Cited by 334
Preissner, S., Kroll, K., Dunkel, M., Senger, C., Goldsobel, G., Kuzman, D., Guenther, S., Winnenburg, R., Schroeder, M., & Preissner, R. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkp970 · Cited by 274
DSX: A Knowledge-Based Scoring Function for the Assessment of Protein–Ligand Complexes
Neudert, G., & Klebe, G. (2011) · Journal of Chemical Information and Modeling · doi:10.1021/ci200274q · Cited by 264
Software for systems biology: from tools to integrated platforms
Ghosh, S., Matsuoka, Y., Asai, Y., Hsin, K.-Y., & Kitano, H. (2011) · Nature Reviews Genetics · doi:10.1038/nrg3096 · Cited by 260
Li, H., Leung, K., Wong, M., & Ballester, P. J. (2015) · Molecular Informatics · doi:10.1002/minf.201400132 · Cited by 252
Large scale relative protein ligand binding affinities using non-equilibrium alchemy
Gapsys, V., Pérez-Benito, L., Aldeghi, M., Seeliger, D., van Vlijmen, H., Tresadern, G., & de Groot, B. L. (2020) · Chemical Science · doi:10.1039/c9sc03754c · Cited by 255
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
Metadata
- Authors
- Plewczynski, D., Łaźniewski, M., Augustyniak, R., & Ginalski, K.
- Venue
- Journal of Computational Chemistry
- Publisher
- Wiley
- Published
- 2010-09
- Volume
- 32
- Issue
- 4
- Pages
- 742-755
- ISSN
- 0192-8651 (ISSN-L)
- 1096-987X
- OpenAlex
- W2120898782
- Cited by
- 407
- References
- 51
- FWCI
- 24.29
- Type
- journal article
- Language
- en
- Open access
- closed
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.