Development and validation of a modular, extensible docking program: DOCK 5
We report on the development and validation of a new version of DOCK. The algorithm has been rewritten in a modular format, which allows for easy implementation of new scoring functions, sampling methods and analysis tools. We validated the sampling algorithm with a test set of 114 protein–ligand complexes. Using an optimized parameter set, we are able to reproduce the crystal ligand pose to within 2 Å of the crystal structure for 79% of the test cases using our rigid ligand docking algorithm with an average run time of 1 min per complex and for 72% of the test cases using our flexible ligand docking algorithm with an average run time of 5 min per complex. Finally, we perform an analysis of the docking failures in the test set and determine that the sampling algorithm is generally sufficient for the binding pose prediction problem for up to 7 rotatable bonds; i.e. 99% of the rigid ligand docking cases and 95% of the flexible ligand docking cases are sampled successfully. We point out that success rates could be improved through more advanced modeling of the receptor prior to docking and through improvement of the force field parameters, particularly for structures containing metal-based cofactors.
KeywordsAutomated docking Scoring functions Structure-based drug design Flexible docking Binding mode prediction Incremental construction Validation
Transient non-covalent interactions are critical for biological processes. The sequencing of a variety of genomes and the development of proteomics techniques have enabled scientists to study these interactions on the widest scales . Advances in X-ray crystallography, nuclear magnetic resonance spectroscopy, and other experimental structure techniques provide the ability to study these interactions at an atomic level of detail . One important application of these advances is the design of small molecules that interact with cellular processes to modify biological activity and treat disease.
The drug discovery process typically requires between 10 years and 15 years from early discovery until FDA approval . Computational tools—such as virtual screening, homology modeling and cheminformatics—are applied both to facilitate various stages of research and to create models that explain experimental data [4, 5, 6]. Molecular docking, which can broadly be defined as the prediction of the orientation of two molecules with respect to one another, is a computational technique that has been successfully used in both of these capacities . In drug design applications, one molecule is typically a protein or nucleic acid drug target—the receptor—and the other is a potential ligand. In these applications, docking is used to identify novel ligands that interact with a biomolecular target and to predict the geometric position (binding mode) of ligands with respect to the target of interest.
Summary of scoring functions and sampling algorithms for commonly used docking programs
Ligand sampling methoda
Receptor sampling methoda
DDD, GB, PB
CE + MC
MM + ED
MM + ED
The number of degrees of freedom in receptor–ligand interactions is very large, and several approximations must be made to ensure that the docking problem is tractable. Many different approaches, ranging from freezing non-essential motions to the use of preferred conformations, have been developed to reduce the number of degrees of freedom sampled . In the DOCK algorithm, for example, the receptor is considered to be conformationally rigid, requiring only the ligand conformational, translational and rotational degrees of freedom to be sampled during complex formation. This assumption is reasonable in docking applications in which either the receptor conformation does not change dramatically upon ligand binding or in which the aim is to stabilize a particular receptor conformation.
In order to evaluate a large number of ligand poses in a reasonable amount of time, approximate scoring functions must be used. Once again, numerous solutions to this problem have been proposed, including a variety of empirical and physics-based terms . DOCK uses an energy scoring function based on the AMBER molecular mechanics force field [14, 16]. Only the interactions between the ligand and protein are considered, leaving only intermolecular van der Waals (VDW) and electrostatic components in the function. Since the receptor is considered to be rigid, the receptor contribution to the potential energy can be pre-calculated and stored on a grid . These approximations enable the program to evaluate large libraries of small molecules against a receptor in a reasonable period of time.
Previous studies have examined the scoring function and the matching algorithm of DOCK in detail ( and equations 1–6 in ). In this paper, we pay particular attention to the robustness of the anchor-and-grow portion of the DOCK algorithm. We seek to maximize the success of complex structure prediction by independently optimizing the various steps in the anchor-and-grow algorithm. In the process, we also quantify and bound the errors for cases in which flexible docking fails and provide direction for potential areas of improvement.
Overview of test set
The validation of any software program requires careful testing of all aspects of the algorithm and assessment of its utility in all anticipated applications of the software. Molecular docking is commonly used in several modes, namely ligand binding mode prediction, virtual screening, and prioritization of a set of related compounds based on their affinity. However, predicting the correct binding mode of a ligand–receptor complex is a requisite step for the successful comparison of different ligands and therefore will be the focus of this paper. It is important to note, however, that predicting binding orientations is not the only metric for the accuracy and utility of docking algorithms. Optimizing DOCK for applications, including ranking libraries of small molecules and calculating absolute free energies of binding, will be addressed in other papers (http://dock.compbio.ucsf.edu).
Large-scale validation of docking algorithms was long hampered by the lack of a large number of high quality protein–ligand complex crystal structures. Thanks to advances in automation in molecular biology and crystallography, the number of structures in the Protein Data Bank (PDB) continues to grow at a rapid pace . The developers of GOLD were first to test their program on a large number of available structures . Their test set was compiled using a number of criteria to select candidate protein–ligand complex structures. The protein must be of pharmacological interest and the ligands must be drug-like. In addition, complexes were chosen that exhibited interesting and unusual interactions between the ligand and the protein. The final set of 100 (more recently expanded to 134) protein–ligand complexes has served as the basis for other, larger test sets [11, 20, 21, 22].
Complexes used in the test set (total of 114 complexes)
Protein data bank identifier
DOCK 4 to DOCK 5 conversion
The new DOCK rigid body orienting code was written as a direct implementation of the isomorphous subgraph matching method of Kuhl et al. . All receptor sphere pairs and atom center pairs are considered for inclusion in a matching clique. This is more computationally demanding than the clique matching algorithm implemented in previous versions of DOCK that used a distance binning algorithm to restrict the clique search, in which pairs of spheres and atom centers were binned by distance. Only sphere pairs and center pairs that were within the same distance bin were considered as potential matches . The new DOCK clique matching implementation avoids bin boundaries that prevent some receptor sphere and ligand atom pairs from matching, and, as a result, it can find good matches missed by previous versions of DOCK. The rigid body rotation code was also corrected to avoid a singularity that occurred if the spheres in the match lay within the same plane. Both of these changes improved orientational sampling.
The anchor-and-grow algorithm in the new version of DOCK was also modified to prevent premature pruning of the growth tree. The DOCK 5 anchor-and-grow code was completely rewritten with several differences in the implementations between DOCK 4 and 5. The anchor-and-grow implementation in DOCK 5 fixed a series of bugs that caused some branches of the search to be pruned when they should have been preserved for the next round of growth. The mechanism of minimization of partially grown conformers was also changed to allow the entire partial conformer to move, instead of just the latest layer, enabling more accurate ranking and pruning of the partially grown conformers.
In addition, the simplex minimizer was re-coded based on the original Nelder and Mead algorithm . The new minimizer implementation consistently found lower energy minima when using the same set of 1,000 ligand orientations in a receptor, indicating that it was performing better than the previous version (data not shown). In addition, we changed the mechanism of minimization of partially grown ligand conformers to allow all atoms in the partial conformer to be minimized, rather than only the outermost layer of atoms. These changes may explain why DOCK 4 performs more poorly when run with the DOCK 5 optimized parameters (see below).
The final version of the new DOCK code, including all functions described below and all bug fixes, was posted to the DOCK web site as version 5.4.0 (http://dock.compbio.ucsf.edu). All experiments performed with the new implementation of DOCK used this version and will be referred to as DOCK 5 for convenience. All experiments performed with the previous version of DOCK used version 4.0.1 and will be referred to as DOCK 4.
Conversion of the DOCK codebase from C to C++
The design of the new DOCK 5 architecture balances the speed of the code, or computational performance, against its modularity and extensibility. The code was developed using ANSI C++ to ensure portability across multiple platforms . The only external library used by DOCK 5 is MPICH for parallel processing . To enable easy modification or replacement of DOCK 5 algorithm components, the DOCK 5 class structure was designed so that there are classes for each major DOCK algorithm function, and these classes interface with each other by passing instances of the DOCK 5 molecule class. Within the major functions, there are two layers of classes: those that implement the ligand sampling functions—rigid orienting, conformational searching, and minimizing—and those that implement the underlying physics engine—the force field definitions and the scoring functions. The sampling classes are applied sequentially to the ligand molecule; the physics engine classes are utilized by the sampling classes to score the ligand–receptor interaction after each step.
As a specific example of modularity, the DOCK 5 scoring functions are implemented as a master score class with five scoring function subclasses. The master score class acts as an interface to the scoring subclasses, enabling the user to designate primary and secondary scoring functions at runtime. This design was chosen because the individual scoring functions were best implemented as individual classes; they each require different input and use different internal data structures. While they could have been implemented into one large scoring class, the result would have been quite large and disjoint. This solution was also applied to the ligand conformational search, energy minimization and post-docking analysis classes.
The DOCK 5 molecule class was designed to contain the minimum information required to specify a three-dimensional ligand conformation (atom coordinates, bond connectivity, atom partial charges, atom types and bond types) to minimize the memory required to store a molecule, allowing large arrays of molecules to be stored in RAM. Standard C-style arrays were used to store the molecular data to maximize the speed of accessing this information.
Test set preparation
The proteins and ligands were extracted from the PDB files, which were downloaded from the PDB website (www.rcsb.org, Table 2). The ligands were assigned atom types and bond types manually, and hydrogens were added using Sybyl . Subsequently, AM1-BCC partial electrostatic charges were calculated using the Antechamber package distributed with Amber 8 [27, 28]. The number of rotatable bonds of each of the ligands was measured using DOCK, and ligands with > 7 rotatable bonds were eliminated from the test set. We choose seven or fewer bonds to give a reasonable representation of DOCK’s performance using compounds similar to those of most interest in drug discovery [29, 30, 31]. The final test set that was used consisted of 114 non-covalent protein–ligand complexes  (Table 2).
Zinc VDW parameters used to generate grids
The GRID accessory program of DOCK was used to pre-calculate scoring function potential grids . All parameters were set to default parameters, except for the “energy_cutoff_distance,” which was set to 9,999, resulting in the inclusion of all protein atoms in the energy calculation. For matching, the dms program was used to generate a molecular surface for each receptor . The SPHGEN accessory program of DOCK was used to create a negative image of the surface using spheres [39, 40]. For the purpose of this validation study, a general procedure was established to generate a sphere cluster for every protein in the test set. In this procedure, we select all the spheres found within 10 Å of any ligand atom. The receptor box delimiting the active side was calculated with the accessory program SHOWBOX using the sphere set with an additional 5 Å boundary. We have explored additional box sizes ranging from 1 Å to 9 Å padding and found that there is little sensitivity to the exact padding amount (i.e. success rate for rigid ligand docking of 80 ± 1%, time increase 10% with padding size increase, and an average test set energy of -50 ± 0.1 DOCK units). The final procedure creates sphere sets with an average of 101 docking spheres and boxes of ∼20 Å3. These receptor sphere sets are larger than what one would typically use in most docking applications. This adds stringency to our testing of DOCK 5 by increasing the orientational and translational space that it must search.
Optimized hydrogen locations for test set receptors
To assess the effect of hydrogen placements on docking outcomes, we also optimized the hydrogen atom placement and hydrogen-bonding network for the receptor using the “Dock Prep” module in Chimera . In this module, the hybridization states of the non-hydrogen atoms of a PDB structure are determined by an enhanced version of the IDATM atom-typing algorithm . Then, all hydrogens that can be unambiguously positioned are added to the file. To assist in positioning ambiguous hydrogens, hydrogen-bonding interactions are examined. The definitions of hydrogen-bonding donors and acceptors as well as hydrogen-bonding angle and distance criteria are based on the values found in Mills and Dean . Relevant hydrogen bonds (H-bonds) are examined from shortest to longest, with satisfaction of shorter bonds having priority. For H-bonds where it is unclear which end is acting as the donor (e.g. water–water), use of that bond is postponed until either end is resolved further, though any lower-priority bonds that conflict geometrically with the postponed bond are eliminated from consideration at that time. If neither end is resolved by other interactions, the ambiguity is decided arbitrarily. Should examination of H-bond interactions not completely determine the positions of all of the hydrogens bound to a heavy atom, they are positioned to first satisfy potential H-bond interactions, then any remaining hydrogens are positioned to avoid steric clashes with other atoms. For histidine residues, normally one nitrogen will be protonated (chosen based on H-bond/steric considerations); however if both ring nitrogens are H-bond donors, they will both be protonated.
Selection of active site waters
All waters within 3 Å RMSD of any ligand heavy atom were selected. These waters were included as part of the receptor. The new receptor–water complexes were then subjected to the same hydrogen bonding optimization as above.
DOCK parameter optimization
To characterize the performance of DOCK 5 in regenerating known complex structures, we explored the optimum parameters for use with rigid and flexible ligand docking strategies (see Appendix 1). Unless otherwise stated, all docking experiments were carried out on 2.2 GHz dual processor Opteron 828s running Linux Fedora Core 3. The code was compiled using open-source GNU compilers (http://www.gnu.org). The optimized parameters have been implemented as the defaults. We note that our primary criterion for optimization was success in finding the proper ligand geometry and not the CPU time required per compound. Unless otherwise stated, these parameters were used for all experiments in this paper.
Greedy clustering of conformational ensemble
The greedy clustering algorithm is designed to eliminate redundant ligand orientations from consideration. DOCK generates a set of ligand orientations that are ranked by the scoring function. The RMSD between each ligand orientation in the list is calculated. If the RMSD between two ligand orientations falls within the clustering threshold, the second orientation is assigned to a cluster with the first. The first ligand orientation is selected and compared to all subsequent unclustered orientations in the list; this process is repeated until the last unclustered orientation has been selected. Once the entire list has been processed, only the best scoring ligand pose in each cluster, designated as the cluster head, is retained.
Evaluation of MPI functionality
Parallel processing is fully integrated into the DOCK calculation. The DOCK program starts a single master node and a set of processing nodes. The master node performs file processing and molecule input/output, whereas the processing nodes perform the actual docking calculations. If the number of processors is set to 1, the code defaults to non-MPI behavior. As a result of this configuration, there will be minimal difference in performance between 1 and 2 processors. Improved performance will only become evident with more than two nodes. It should be emphasized that the primary benefit in using DOCK 5 in parallel mode is to reduce bookkeeping tasks associated with manually splitting up a database into multiple chunks, which then must be submitted to different processors individually. DOCK 5 automatically partitions out subsets of a database to various nodes, collates and ranks the final results, and takes care of all intermediate bookkeeping.
To gauge the performance of parallelization of the DOCK 5 algorithm, two small subsets of the NCI database from the ZINC database were constructed [25, 44]. The two subsets, one containing 500 and the other 1,000 small molecules, were filtered to have ≤5 and ≤14 rotatable bonds, respectively. The receptor used as a target for this study was HIV-1 reverse transcriptase in complex with nevirapine (PDB code 1VRT). Because the receptor was not part of the test set, nevirapine was flexibly redocked using the optimized parameters, which yielded a ligand orientation 0.28 Å RMSD from the crystal structure orientation. In addition, a library consisting of 1,000 copies of neviripine was generated to remove dependence on the order and size of the compound library. All parallelization study calculations were executed at the Computational Science Center at Brookhaven National Laboratory (http://www.bnl.gov/csc) on a cluster consisting of 34 nodes with dual 3.2 GHz Xeon processors running Linux. Tests were performed using between 2 and 68 nodes. The code was compiled using open-source GNU compilers and MPI software mpich version 1.2.7 from Argonne National Laboratory (http://wwwunix.mcs.anl.gov/mpi/mpich).
We first consider the results of rigidly docking ligands, which used a conformation taken directly from the complex crystal structure, to the complex crystal structure conformation of the receptor. We then present the results of flexible ligand docking tests. In each case, we consider (a) the overall performance of each sampling algorithm, (b) the ability of each algorithm to reproduce the crystal ligand orientation as the top-scoring pose, (c) the effect of the initial ligand conformation on the performance of the algorithm, (d) any additional information contained in the set of all sampled ligand orientations, and (e) the ability to extract additional information by clustering docking results. We also compare the performance of DOCK 5 to equivalent DOCK 4 experiments. Finally, we analyze the cases in which DOCK 5 fails to reproduce the crystal structure and propose some directions for improvement of both the DOCK algorithm and our test set preparation method.
Rigid ligand docking
Unless otherwise noted, all experiments described in this section involved rigid docking of the complex crystal structure ligand conformation to the receptor complex crystal structure. For each case in the test set, the heavy atom RMSD between the top-scoring docked ligand pose and the complex crystal structure ligand pose was evaluated. A DOCK 5 run was considered to be successful for cases in which the RMSD between for the top-scoring ligand orientation and the crystal ligand orientation was less than 2.0 Å. DOCK 5 selects the correct pose as the lowest energy structure for 79% (90/114) of the test cases using the rigid docking protocol with an average time of 55 s per complex.
Dependence on ligand conformation
Analysis of total orientational ensemble
To this point, we have disregarded “near misses,” which we define as any generated orientations within 2 Å RMSD from the crystal structure that are close to the top of the ranked conformation list, but are not the best scoring poses. We can examine the remaining poses either by including all poses that differ by a fixed energy unit from the most favorable geometry or by including those that differ by a fixed number of ranked poses from the most favorable energy. In order to quantify the extent of these partial successes, all generated ligand poses for each test case were preserved and sorted by their energy scores.
Geometric clustering of poses
Flexible ligand docking
Unless otherwise noted, all experiments described in this section involved flexible docking of the ligand to the receptor complex crystal structure. As with the rigid docking tests, the heavy atom RMSD between the top-scoring docked ligand pose and the complex crystal structure ligand pose was evaluated for each complex in the test set. The success rate over the entire test set using the optimized flexible ligand anchor-and-grow protocol was 72% (82/114) with an average time of 314 s per complex.
Dependence on anchor position
The anchor-and-grow algorithm belongs to the set of incremental construction algorithms for searching ligand conformational space [14, 15]. It uses a rigid docking step for the “anchors” to identify likely anchor positions (anchor orienting), and a torsion angle search step to generate ligand conformations rooted at the previously identified anchor positions (flexible growth). In order for flexible docking to succeed, both of these individual steps must be successful.
To measure the dependence of success rate on the precision of the anchor location, the crystal position of the anchor for each complex in the test set was perturbed randomly from 0 Å to more than 10 Å. Each perturbed anchor position was then considered as the starting point for flexible growth (Fig. 3b). With the anchor starting less than 0.5 Å heavy atom RMSD from the crystal orientation, the growth algorithm can find the experimental orientation 99% of the time. However, the results demonstrate a rapid decrease in success rate as the anchor is moved further away from its crystal structure position, decreasing to 76% at 1.0 Å perturbation down to 54% at 2.0 Å. These data imply that if the flexible ligand docking algorithm can place the anchor within 0.5 Å heavy atom RMSD of the crystal anchor position, DOCK 5 has a very high probability of successfully predicting the full binding mode correctly.
Analysis of total conformational ensemble
We examined the entire ensemble of conformers generated by flexible docking, as we described previously in the rigid ligand docking analysis. Considering all docked ligand conformations with a 2.5 DOCK unit energy gap—an average of five ligand orientations—increases the success rate to 82%, while an average of 100 orientations increasing the success rate to 95% (Fig. 4a, b). Again, these results indicate that the sampling density produced by the optimized parameters is quite high, but there is little discrimination between very similar poses by the current scoring function.
Geometric clustering of poses
As with the rigid ligand docking tests, each conformational ensemble was spatially clustered according to interpose RMSD (see Methods section for algorithm details). A clustering threshold of 1.0 Å, as determined in the rigid docking section, was used (Fig. 5). Using this clustering threshold, only 50 clusterheads must be examined to reach a success rate of 95% as compared to 100 purely ranked orientations. Once again, this result is encouraging, as it requires a small number of ligand poses to be retained for rescoring with more advanced scoring functions that are better at discriminating between very similar ligand poses.
Comparison to DOCK 4
Success based on DOCK version (see Methods)
Average length of time in seconds for docking calculation using the optimized parameter set (see Appendix 1)
DOCK 4 rigid lig
10.9 ± 12.1
DOCK 4 flexible lig
7.1 ± 6.04
DOCK 5 rigid lig
55.4 ± 37.5
DOCK 5 flexible lig
314.7 ± 449.8
Comparison to other docking methods
Comparison of DOCK success rates to other docking programs for flexible ligand docking
No. of complexes
Analysis of successes and failures of docking protocols
Docking failures can be categorized into two categories: sampling (soft) and scoring (hard) failures . For scoring failures, an orientation near the crystal structure was sampled in the course of the DOCK run, but the scoring function failed to rank it at the top of the list. A sampling failure indicates that the DOCK run failed to sample any orientations within 2 Å RMSD of the crystal structure. The major caveat of this classification scheme is the assumption that the model of both the receptor and the ligand, including the VDW parameters, electrostatics, and hydrogen orientations and protonation states, reflect those that occur in the experimental structure . Here, we analyze the flexible docking ligand failures within the sampling-scoring classification scheme.
Failures resulting from receptor modeling/structural problems
Success as function of active site cofactor
Entire test set
Active site cofactor
Active site metal cofactor
Flexible ligand success as function of CF test set preparation (total of 76 complexes)
Test set preparation technique
Active site waters + hydrogen optimization
Failures resulting from ligand flexibility
Sampling versus scoring failures
Comparison of success and failure cases of both rigid and flexible docking for complexes in test set with cofactors in active site (total of 36 complexes)
Rigid sampling failure
Rigid scoring failure
Flexible sampling failure
Flexible scoring failure
Comparison of success and failure cases of both rigid and flexible docking for complexes in CF subset (total of 76 complexes)
Rigid sampling failure
Rigid scoring failure
Flexible sampling failure
Flexible scoring failure
As in the cofactor set above, there were only three additional flexible ligand docking sampling failures. One of these was also a scoring failure in rigid ligand docking, implying that this failure case may actually be due to a combination of both sampling and scoring factors. The remaining two flexible ligand docking sampling failures once again indicate that the flexible algorithm was able to identify alternative orientations that scored better than the crystal complex orientation. Finally, five rigid ligand docking scoring failures were flexible ligand dockings successes, signifying that the flexible ligand docking algorithm is able to compensate for intermolecular clashes in the active site of the experimental structure that the rigid ligand algorithm simple cannot accommodate (data not shown).
Analysis of DOCK score for docking protocols
Database docking using MPI
In this paper we have described a new version of the DOCK program. Our main purpose was to develop modular code that was straightforward to modify and which showed improved performance over the old version. By using an object-oriented language for DOCK 5, we were able to accomplish this goal, and we demonstrate, here, how routines such as the simplex minimizer and the clustering algorithm can be added or replaced without changes in other parts of the program. The successful parallelization of the calculation and the addition of post-processing clustering were simple but useful modifications to the algorithm, which encourages further investigations and algorithm experimentation.
The performance of DOCK 5 on a curated test set of 114 protein–ligand complexes proved to be superior to DOCK 4, with an over-all success rate of 79% for rigid ligand docking and 72% for flexible ligand docking, compared with 72 and 42%, respectively for DOCK 4. We ascribe the improvements to significant changes in the flexible search sampling and pruning procedures and to code corrections. The difference in performance of DOCK 5 for rigid and flexible docking is relatively modest (79% vs. 72%) even though the search for flexible ligands includes both configurational and conformational spaces. Using the receptor structure to prune the conformational search tree is clearly a reasonably efficient procedure. Although, the DOCK 5 code takes longer on average to run a calculation than DOCK 4, we feel this drawback is balanced by the improved results and the modularity of DOCK 5. Efforts to increase throughput are underway.
We also wish to stress the importance of having a high quality test set for evaluation of docking programs. X-ray crystallography typically provides essential but incomplete data for the calculations we wish to carry out. For example, in the majority of cases, hydrogen positions must be determined. In other cases, critical water molecules must be placed and some residues need to be modeled where experimental data is lacking. The ligand conformations may also contain significant uncertainties. Finally, we must be aware of the inherent assumptions underlying the force field parameters used in the molecular modeling steps. All of these considerations speak to the need for careful inspection of test set complexes. Our results demonstrate this issue: the success rate for reconstitution of the complex geometries was shown to depend on the nature of the cofactors, the optimization of hydrogen placements, and the inclusion of critical waters.
The primary result that emerges from the analysis of the docking failures is that the current force field requires improvement, particularly in the treatment of metal-containing cofactors. We also note that binding conformations and configurations are determined by the free energy of the system while we are only, at best, estimating the enthalpy. Finally, we do identify a few situations in flexible ligand docking where the conformational sampling is insufficient. A test set with ligands containing more than seven rotatable bonds would, presumably, show an increase in these sampling failures. We hypothesize that the key weakness is the pruning algorithm, which we will explore in future studies.
What are the routes to improvement? An obvious starting point is the use of more accurate methods for preparing experimental structures, including tools for accurate pKa prediction and de novo identification of critical waters. For the docking calculation itself, it would be helpful to improve VDW and electrostatic parameters for all atoms heavier than oxygen, particularly for metal atoms. Ideally, one would directly include charge polarization and ligation geometry in the force field. In addition, modifications to the force field to better approximate the free energy—e.g. generalized Born or Poisson Boltzmann implicit solvation electrostatics with surface area corrections to account for the hydrophobic effect—would also improve modeling accuracy. The DOCK 5 platform is positioned to enable future developments and work is underway to incorporate them into future releases.
In this study, we have evaluated a new version of DOCK. We have found that it predicts binding geometries of a structurally diverse test set comparably to similar algorithms and better than the previous version of DOCK. Simultaneously, we have thoroughly explored the sampling portions of the algorithm and found that the majority of binding pose prediction failures is a result of scoring function deficiencies. In further exploration of these failures, we have determined that the docking success seems to be a function of whether there are alternative orientations that score well—as defined by the scoring function—rather than the interaction energy of the experimental structure itself. Finally, we have implemented new functionalities and shown that they improve the success rates of both rigid and flexible ligand docking. In general, we have a new tool that not only performs well on a typical test set but is an ideal tool to explore any number of new algorithms in the context of the molecular docking problem.
Gratitude is expressed to Dr. Bentley Strockbine and Sudipto Mukherjee for computational assistance with MPI calculations. Demetri Moustakas, Natasja Brooijmans, P. Therese Lang and Irwin D. Kuntz would like to thank the NIH grant GM 56531 (Paul Ortiz de Montellano, PI) for support. P. Therese Lang would also like to thank the Burroughs Welcome Foundation and the American Foundation for Pharmaceutical Education for additional support. The authors would like to thank Scott Brozell, Mathew Jacobson, and Brian Shoichet and members of his group for helpful conversations.
- 6.Posner BA (2005) Curr Opin Drug Discovery Dev 8:487Google Scholar
- 17.Lischner R (2003) C++ in a nutshell. 1st edn. O’Reilly Media, Inc, Sebastopol, CAGoogle Scholar
- 24.Nelder JA, Mead R (1965) Comput J 7:308Google Scholar
- 26.SYBYL, Tripos, Inc., St. Louis, Missouri, 63144Google Scholar
- 27.Case DA, Darden TA, Cheatham III, TE, Simmerling CL, Wang J, Duke RE, Luo R, Merz KM, Wang B, Pearlman DA, Crowley M, Brozell S, Tsui V, Gohlke H, Mongan J, Hornak V, Cui G, Beroza P, Schafmeister C, Caldwell JW, Ross WS, Kollman PA (2004) AMBER 8, University of California, San FranciscoGoogle Scholar
- 32.Brooijmans N (2003) Theoretical studies of molecular recognition, Graduate Department of Chemistry and Chemical Biology, University of California, San Francisco, San Francisco, CAGoogle Scholar
- 45.The results for the FlexX test set are available at http://www.biosolveit.de/FlexX/Google Scholar
- 46.The results for the GOLD test set are available at http://www.ccdc.cam.ac.uk/products/life_sciences/validate/gold_validation/value.htmlGoogle Scholar
- 48.Kuntz ID, Agard DA (2003) Adv Protein Chem 66:1Google Scholar