PubMed Health⌕ Search

PubMed · 17073642

Docking and scoring--theoretically easy, practically impossible?

Abstract

Structure-based Drug Design (SBDD) is an essential part of the modern medicinal chemistry, and has led to the acceleration of many projects, and even to drugs on the market. Programs that perform docking and scoring of ligands to receptors are powerful tools in the drug designer's armoury that enhance the process of SBDD. They are even deployed on the desktop of many bench chemists. It is timely to review the state of the art, to understand how good our docking programs are, and what are the issues. In this review we would like to provide a guide around the reliable aspects of docking and scoring and the associated pitfalls aiming at an audience of medicinal chemists rather than modellers. For convenience, we will divide the review into two parts: docking and scoring. Docking concerns the preparation of the receptor and the ligand(s), the sampling of conformational space and stereochemistry (if appropriate). Scoring concerns the evaluation of all of the ligand-receptor poses generated by docking. The two processes are not truly independent, and this will be discussed here in detail. The preparation of the receptor and ligand(s) before docking requires great care. For the receptor, issues of protonation, tautomerisation and hydration are key, and we will discuss current approaches to these issues. Even more important is the degree of sampling: can the algorithms reproduce what is observed experimentally? If they can, are the scoring algorithms good enough to recognise this pose as the best? Do the scores correlate with observed binding affinity? How does local knowledge of the target (for example hinge-binding to a kinase) affect the accuracy of the predictions? We will review the key findings from several evaluation studies and present conclusions about when and how to interpret and trust the results of docking and scoring. Finally, we will present an outline of some of the latest developments in the area of scoring functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

B Coupez, R A Lewis. 2006. Docking and scoring--theoretically easy, practically impossible?. https://doi.org/10.2174/092986706778521797

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

Clustering individuals using INMTD: a novel versatile multi-view embedding framework integrating omics and imaging data.

MOTIVATION: Combining omics and images can lead to a more comprehensive clustering of individuals than classic single-view approaches. Among the various approaches for multi-view clustering, nonnegative matrix tri-factorization (NMTF) and nonnegative Tucker decomposition (NTD) are advantageous in learning low-rank embeddings with promising interpretability. Besides, there is a need to handle unwanted drivers of clusterings (i.e. confounders). RESULTS: In this work, we introduce a novel multi-view clustering method based on NMTF and NTD, named INMTD, which integrates omics and 3D imaging data to derive unconfounded subgroups of individuals. According to the adjusted Rand index, INMTD outperformed other clustering methods on a synthetic dataset with known clusters. In the application to real-life facial-genomic data, INMTD generated biologically relevant embeddings for individuals, genetics, and facial morphology. By removing confounded embedding vectors, we derived an unconfounded clustering with better internal and external quality; the genetic and facial annotations of each derived subgroup highlighted distinctive characteristics. In conclusion, INMTD can effectively integrate omics data and 3D images for unconfounded clustering with biologically meaningful interpretation. AVAILABILITY AND IMPLEMENTATION: INMTD is freely available at https://github.com/ZuqiLi/INMTD.

Cluster Analysis↗

Relative efficiency of unequal versus equal cluster sizes in cluster randomized and multicentre trials.

Cluster randomized and multicentre trials evaluate the effect of a treatment on persons nested within clusters, for instance, patients within clinics or pupils within schools. Optimal sample sizes at the cluster (centre) and person level have been derived under the restrictive assumption of equal sample sizes per cluster. This paper addresses the relative efficiency of unequal versus equal cluster sizes in case of cluster randomization and person randomization within clusters. Starting from maximum likelihood parameter estimation, the relative efficiency is investigated numerically for a range of cluster size distributions. An approximate formula is presented for computing the relative efficiency as a function of the mean and variance of cluster size and the intraclass correlation, which can be used for adjusting the sample size. The accuracy of this formula is checked against the numerical results and found to be quite good. It is concluded that the loss of efficiency due to variation of cluster sizes rarely exceeds 10 per cent and can be compensated by sampling 11 per cent more clusters.

Cluster Analysis↗

A spatial scan statistic for ordinal data.

Spatial scan statistics are widely used for count data to detect geographical disease clusters of high or low incidence, mortality or prevalence and to evaluate their statistical significance. Some data are ordinal or continuous in nature, however, so that it is necessary to dichotomize the data to use a traditional scan statistic for count data. There is then a loss of information and the choice of cut-off point is often arbitrary. In this paper, we propose a spatial scan statistic for ordinal data, which allows us to analyse such data incorporating the ordinal structure without making any further assumptions. The test statistic is based on a likelihood ratio test and evaluated using Monte Carlo hypothesis testing. The proposed method is illustrated using prostate cancer grade and stage data from the Maryland Cancer Registry. The statistical power, sensitivity and positive predicted value of the test are examined through a simulation study.

Cluster Analysis↗