Comparing protein-ligand docking programs is difficult.
There is currently great interest in comparing protein-ligand docking programs. A review of recent comparisons shows that it is difficult to draw conclusions of general applicability. Statistical hypothesis testing is required to ensure that differences in pose-prediction success rates and enrichment rates are significant. Numerical measures such as root-mean-square deviation need careful interpretation and may profitably be supplemented by interaction-based measures and visual inspection of dockings. Test sets must be of appropriate diversity and of good experimental reliability. The effects of crystal-packing interactions may be important. The method used for generating starting ligand geometries and positions may have an appreciable effect on docking results. For fair comparison, programs must be given search problems of equal complexity (e.g. binding-site regions of the same size) and approximately equal time in which to solve them. Comparisons based on rescoring require local optimization of the ligand in the space of the new objective function. Re-implementations of published scoring functions may give significantly different results from the originals. Ostensibly minor details in methodology may have a profound influence on headline success rates.
Cole
Jason C
JC
Cambridge Crystallographic Data Centre, Cambridge, United Kingdom.
Murray
Christopher W
CW
Nissink
J Willem M
JW
Taylor
Richard D
RD
Taylor
Robin
R
D000465:Algorithms; D001185:Artificial Intelligence; D001665:Binding Sites; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D003460:Crystallization; D018360:Crystallography, X-Ray; D030562:Databases, Protein; D008024:Ligands; D008958:Models, Molecular; D015394:Molecular Structure; D011381:Programming Languages; D011485:Protein Binding; D011506:Proteins / Q000737:chemistry*; D040901:Proteomics / Q000379:methods*; D015203:Reproducibility of Results; D012984:Software
D008024:Ligands; D011506:Proteins