MCDOCK: A Monte Carlo simulation approach to the molecular docking problem

Prediction of the binding mode of a ligand (a drug molecule) to its macromolecular receptor, or molecular docking, is an important problem in rational drug design. We have developed a new docking method in which a non-conventional Monte Carlo (MC) simulation technique is employed. A computer program, MCDOCK, was developed to carry out the molecular docking operation automatically. The current version of the MCDOCK program (version 1.0) allows for the full flexibility of ligands in the docking calculations. The scoring function used in MCDOCK is the sum of the interaction energy between the ligand and its receptor, and the conformational energy of the ligand. To validate the MCDOCK method, 19 small ligands, the binding modes of which had been determined experimentally using X-ray diffraction, were docked into their receptor binding sites. To produce statistically significant results, 20 MCDOCK runs were performed for each protein–ligand complex. It was found that a significant percentage of these MCDOCK runs converge to the experimentally observed binding mode. The root-mean-square (rms) of all non-hydrogen atoms of the ligand between the predicted and experimental binding modes ranges from 0.25 to 1.84 Å for these 19 cases. The computational time for each run on an SGI Indigo2/R10000 varies from less than 1 min to 15 min, depending upon the size and the flexibility of the ligands. Thus MCDOCK may be used to predict the precise binding mode of ligands in lead optimization and to discover novel lead compounds through structure-based database searching.     

Theory of docking scores and its application to a customizable scoring function

In general, the docking scoring tends to have a size dependence related to the ranking of compounds. In this paper, we describe a novel method of parameter optimization for docking scores which reduce the size dependence and can efficiently discriminate active compounds from chemical databases. This method is based on a simplified theoretical model of docking scores which enables us to utilize large amounts of data of known active and inactive compounds for a particular target without requiring large computational resources or a complicated procedure. This method is useful for making scoring functions for the identification of novel scaffolds using the knowledge of active compounds for a particular target or a customized scoring function for an interesting family of drug targets.     

GalaxyDock3: Protein–ligand docking that considers the full ligand conformational flexibility

Predicting conformational changes of both the protein and the ligand is a major challenge when a protein–ligand complex structure is predicted from the unbound protein and ligand structures. Herein, we introduce a new protein–ligand docking program called GalaxyDock3 that considers the full ligand conformational flexibility by explicitly sampling the ligand ring conformation and allowing the relaxation of the full ligand degrees of freedom, including bond angles and lengths. This method is based on the previous version (GalaxyDock2) which performs the global optimization of a designed score function. Ligand ring conformation is sampled from a ring conformation library constructed from structure databases. The GalaxyDock3 score function was trained with an additional bonded energy term for the ligand on a large set of complex structures. The performance of GalaxyDock3 was improved compared to GalaxyDock2 when predicted ligand conformation was used as the input for docking, especially when the input ligand conformation differs significantly from the crystal conformation. GalaxyDock3 also compared favorably with other available docking programs on two benchmark tests that contained diverse ligand rings. The program is freely available at http://galaxy.seoklab.org/softwares/galaxydock.html . © 2019 Wiley Periodicals, Inc.     

FIPSDock: A new molecular docking technique driven by fully informed swarm optimization algorithm

The accurate prediction of protein–ligand binding is of great importance for rational drug design. We present herein a novel docking algorithm called as FIPSDock, which implements a variant of the Fully Informed Particle Swarm (FIPS) optimization method and adopts the newly developed energy function of AutoDock 4.20 suite for solving flexible protein–ligand docking problems. The search ability and docking accuracy of FIPSDock were first evaluated by multiple cognate docking experiments. In a benchmarking test for 77 protein/ligand complex structures derived from GOLD benchmark set, FIPSDock has obtained a successful predicting rate of 93.5% and outperformed a few docking programs including particle swarm optimization (PSO)@AutoDock, SODOCK, AutoDock, DOCK, Glide, GOLD, FlexX, Surflex, and MolDock. More importantly, FIPSDock was evaluated against PSO@AutoDock, SODOCK, and AutoDock 4.20 suite by cross‐docking experiments of 74 protein–ligand complexes among eight protein targets (CDK2, ESR1, F2, MAPK14, MMP8, MMP13, PDE4B, and PDE5A) derived from Sutherland‐crossdock‐set. Remarkably, FIPSDock is superior to PSO@AutoDock, SODOCK, and AutoDock in seven out of eight cross‐docking experiments. The results reveal that FIPS algorithm might be more suitable than the conventional genetic algorithm‐based algorithms in dealing with highly flexible docking problems. © 2012 Wiley Periodicals, Inc.     

Exploring hierarchical refinement techniques for induced fit docking with protein and ligand flexibility

We present a series of molecular‐mechanics‐based protein refinement methods, including two novel ones, applied as part of an induced fit docking procedure. The methods used include minimization; protein and ligand sidechain prediction; a hierarchical ligand placement procedure similar to a‐priori protein loop predictions; and a minimized Monte Carlo approach using normal mode analysis as a move step. The results clearly indicate the importance of a proper opening of the active site backbone, which might not be accomplished when the ligand degrees of freedom are prioritized. The most accurate method consisted of the minimized Monte Carlo procedure designed to open the active site followed by a hierarchical optimization of the sidechain packing around a mobile flexible ligand. The methods have been used on a series of 88 protein‐ligand complexes including both cross‐docking and apo‐docking members resulting in complex conformations determined to within 2.0 Å heavy‐atom RMSD in 75% of cases where the protein backbone rearrangement upon binding is less than 1.0 Å α‐carbon RMSD. We also demonstrate that physics‐based all‐atom potentials can be more accurate than docking‐style potentials when complexes are sufficiently refined. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

Attracting cavities for docking. Replacing the rough energy landscape of the protein by a smooth attracting landscape

Molecular docking is a computational approach for predicting the most probable position of ligands in the binding sites of macromolecules and constitutes the cornerstone of structure‐based computer‐aided drug design. Here, we present a new algorithm called Attracting Cavities that allows molecular docking to be performed by simple energy minimizations only. The approach consists in transiently replacing the rough potential energy hypersurface of the protein by a smooth attracting potential driving the ligands into protein cavities. The actual protein energy landscape is reintroduced in a second step to refine the ligand position. The scoring function of Attracting Cavities is based on the CHARMM force field and the FACTS solvation model. The approach was tested on the 85 experimental ligand–protein structures included in the Astex diverse set and achieved a success rate of 80% in reproducing the experimental binding mode starting from a completely randomized ligand conformer. The algorithm thus compares favorably with current state‐of‐the‐art docking programs. © 2015 The Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc.     

Molecular modeling study of checkpoint kinase 1 inhibitors by multiple docking strategies and prime/MM-GBSA calculation

Developing chemicals that inhibit checkpoint kinase 1 (Chk1) is a promising adjuvant therapeutic to improve the efficacy and selectivity of DNA-targeting agents. Reliable prediction of binding-free energy and binding affinity of Chk1 inhibitors can provide a guide for rational drug design. In this study, multiple docking strategies and Prime/Molecular Mechanics Generalized Born Surface Area (Prime/MM-GBSA) calculation were applied to predict the binding mode and free energy for a series of benzoisoquinolinones as Chk1 inhibitors. Reliable docking results were obtained using induced-fit docking and quantum mechanics/molecular mechanics (QM/MM) docking, which showed superior performance on both ligand binding pose and docking score accuracy to the rigid-receptor docking. Then, the Prime/MM-GBSA method based on the docking complex was used to predict the binding-free energy. The combined use of QM/MM docking and Prime/MM-GBSA method could give a high correlation between the predicted binding-free energy and experimentally determined pIC(50) . The molecular docking combined with Prime/MM-GBSA simulation can not only be used to rapidly and accurately predict the binding-free energy of novel Chk1 inhibitors but also provide a novel strategy for lead discovery and optimization targeting Chk1.     

A novel scoring function for molecular docking

We present a novel scoring function for docking of small molecules to protein binding sites. The scoring function is based on a combination of two main approaches used in the field, the empirical and knowledge-based approaches. To calibrate the scoring function we used an iterative procedure in which a ligand's position and its score were determined self-consistently at each iteration. The scoring function demonstrated superiority in prediction of ligand positions in docking tests against the commonly used Dock, FlexX and Gold docking programs. It also demonstrated good accuracy of binding affinity prediction for the docked ligands.     

Multiple ligand simultaneous docking: Orchestrated dancing of ligands in binding sites of protein

Present docking methodologies simulate only one single ligand at a time during docking process. In reality, the molecular recognition process always involves multiple molecular species. Typical protein–ligand interactions are, for example, substrate and cofactor in catalytic cycle; metal ion coordination together with ligand(s); and ligand binding with water molecules. To simulate the real molecular binding processes, we propose a novel multiple ligand simultaneous docking (MLSD) strategy, which can deal with all the above processes, vastly improving docking sampling and binding free energy scoring. The work also compares two search strategies: Lamarckian genetic algorithm and particle swarm optimization, which have respective advantages depending on the specific systems. The methodology proves robust through systematic testing against several diverse model systems: E. coli purine nucleoside phosphorylase (PNP) complex with two substrates, SHP2NSH2 complex with two peptides and Bcl‐xL complex with ABT‐737 fragments. In all cases, the final correct docking poses and relative binding free energies were obtained. In PNP case, the simulations also capture the binding intermediates and reveal the binding dynamics during the recognition processes, which are consistent with the proposed enzymatic mechanism. In the other two cases, conventional single‐ligand docking fails due to energetic and dynamic coupling among ligands, whereas MLSD results in the correct binding modes. These three cases also represent potential applications in the areas of exploring enzymatic mechanism, interpreting noisy X‐ray crystallographic maps, and aiding fragment‐based drug design, respectively. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010     

Deciphering common failures in molecular docking of ligand-protein complexes

Common failures in predicting crystal structures of ligand-protein complexes are investigated for three ligand-protein systems by a combined thermodynamic and kinetic analysis of the binding energy landscapes. Misdocked predictions in ligand-protein docking are classified as `soft' and `hard' failures. While a soft failure arises when the search algorithm is unable to find the global energy minimum corresponding to the crystal structure, a hard failure results from a flaw of the energy function to qualify the crystal structure as the predicted lowest energy conformation in docking simulations. We find that neither the determination of a single structure with the lowest energy nor finding the most common binding mode is sufficient to predict crystal structures of the complexes, which belong to the category of hard failures. In a proposed hierarchical approach, structural similarity clustering of the conformations, generated from equilibrium simulations with the simplified energy function, is followed by energy refinement with the AMBER force field. This protocol, that involves a hierarchy of energy functions, resolves some common failures in ligand-protein docking and detects crystallographic binding modes that were not found during docking simulations.     

FDS: flexible ligand and receptor docking with a continuum solvent model and soft-core energy function

The docking of flexible small molecule ligands to large flexible protein targets is addressed in this article using a two-stage simulation-based method. The methodology presented is a hybrid approach where the first component is a dock of the ligand to the protein binding site, based on deriving sets of simultaneously satisfied intermolecular hydrogen bonds using graph theory and a recursive distance geometry algorithm. The output structures are reduced in number by cluster analysis based on distance similarities. These structures are submitted to a modified Monte Carlo algorithm using the AMBER-AA molecular mechanics force field with the Generalized Born/Surface Area (GB/SA) continuum model. This solvent model is not only less expensive than an explicit representation, but also yields increased sampling. Sampling is also increased using a rotamer library to direct some of the protein side-chain movements along with large dihedral moves. Finally, a softening function for the nonbonded force field terms is used, enabling the potential energy function to be slowly turned on throughout the course of the simulation. The docking procedure is optimized, and the results are presented for a single complex of the arabinose binding protein. It was found that for a rigid receptor model, the X-ray binding geometry was reproduced and uniquely identified based on the associated potential energy. However, when side-chain flexibility was included, although the X-ray structure was identified, it was one of three possible binding geometries that were energetically indistinguishable. These results suggest that on relaxing the constraint on receptor flexibility, the docking energy hypersurface changes from being funnel-like to rugged. A further 14 complexes were then examined using the optimized protocol. For each complex the docking methodology was tested for a fully flexible ligand, both with and without protein side-chain flexibility. For the rigid protein docking, 13 out of the 15 test cases were able to find the experimental binding mode; this number was reduced to 11 for the flexible protein docking. However, of these 11, in the majority of cases the experimental binding mode was not uniquely identified, but was present in a cluster of low energy structures that were energetically indistinguishable. These results not only support the presence of a rugged docking energy hypersurface, but also suggest that it may be necessary to consider the possibility of more than one binding conformation during ligand optimization.     

Q-Dock: Low-resolution flexible ligand docking with pocket-specific threading restraints

The rapidly growing number of theoretically predicted protein structures requires robust methods that can utilize low-quality receptor structures as targets for ligand docking. Typically, docking accuracy falls off dramatically when apo or modeled receptors are used in docking experiments. Low-resolution ligand docking techniques have been developed to deal with structural inaccuracies in predicted receptor models. In this spirit, we describe the development and optimization of a knowledge-based potential implemented in Q-Dock, a low-resolution flexible ligand docking approach. Self-docking experiments using crystal structures reveals satisfactory accuracy, comparable with all-atom docking. All-atom models reconstructed from Q-Dock's low-resolution models can be further refined by even a simple all-atom energy minimization. In decoy-docking against distorted receptor models with a root-mean-square deviation, RMSD, from native of approximately 3 A, Q-Dock recovers on average 15-20% more specific contacts and 25-35% more binding residues than all-atom methods. To further improve docking accuracy against low-quality protein models, we propose a pocket-specific protein-ligand interaction potential derived from weakly homologous threading holo-templates. The success rate of Q-Dock employing a pocket-specific potential is 6.3 times higher than that previously reported for the Dolores method, another low-resolution docking approach.     

A new method for ligand docking to flexible receptors by dual alanine scanning and refinement (SCARE)

Protein binding sites undergo ligand specific conformational changes upon ligand binding. However, most docking protocols rely on a fixed conformation of the receptor, or on the prior knowledge of multiple conformations representing the variation of the pocket, or on a known bounding box for the ligand. Here we described a general induced fit docking protocol that requires only one initial pocket conformation and identifies most of the correct ligand positions as the lowest score. We expanded a previously used diverse "cross-docking" benchmark to thirty ligand-protein pairs extracted from different crystal structures. The algorithm systematically scans pairs of neighbouring side chains, replaces them by alanines, and docks the ligand to each 'gapped' version of the pocket. All docked positions are scored, refined with original side chains and flexible backbone and re-scored. In the optimal version of the protocol pairs of residues were replaced by alanines and only one best scoring conformation was selected from each 'gapped' pocket for refinement. The optimal SCARE (SCan Alanines and REfine) protocol identifies a near native conformation (under 2 angstroms RMSD) as the lowest rank for 80% of pairs if the docking bounding box is defined by the predicted pocket envelope, and for as many as 90% of the pairs if the bounding box is derived from the known answer with approximately 5 angstroms margin as used in most previous publications. The presented fully automated algorithm takes about 2 h per pose of a single processor time, requires only one pocket structure and no prior knowledge about the binding site location. Furthermore, the results for conformationally conserved pockets do not deteriorate due to substantial increase of the pocket variability.     

Ligand-protein docking with water molecules

The presence of water molecules plays an important role in the accuracy of ligand-protein docking predictions. Comprehensive docking simulations have been performed on a large set of ligand-protein complexes whose crystal structures contain water molecules in their binding sites. Only those water molecules found in the immediate vicinity of both the ligand and the protein were considered. We have investigated whether prior optimization of the orientation of water molecules in either the presence or absence of the bound ligand has any effect on the accuracy of docking predictions. We have observed a statistically significant overall increase in accuracy when water molecules are included during docking simulations and have found this to be independent of the method of optimization of the orientation of water molecules. These results confirm the importance of including water molecules whenever possible in a ligand-protein docking simulation. Our findings also reveal that prior optimization of the orientation of water molecules, in the absence of any bound ligand, does not have a detrimental effect on the improved accuracy of ligand-protein docking. This is important, given the use of docking simulations to predict the binding modes of new ligands or drug molecules.     

A Bayesian statistical approach of improving knowledge‐based scoring functions for protein–ligand interactions

Knowledge‐based scoring functions are widely used for assessing putative complexes in protein–ligand and protein–protein docking and for structure prediction. Even with large training sets, knowledge‐based scoring functions face the inevitable problem of sparse data. Here, we have developed a novel approach for handling the sparse data problem that is based on estimating the inaccuracies in knowledge‐based scoring functions. This inaccuracy estimation is used to automatically weight the knowledge‐based scoring function with an alternative, force‐field‐based potential (FFP) that does not rely on training data and can, therefore, provide an improved approximation of the interactions between rare chemical groups. The current version of STScore, a protein–ligand scoring function using our method, achieves a binding mode prediction success rate of 91% on the set of 100 complexes by Wang et al., and a binding affinity correlation of 0.514 with the experimentally determined affinities in PDBbind. The method presented here may be used with other FFPs and other knowledge‐based scoring functions and can also be applied to protein–protein docking and protein structure prediction. © 2014 Wiley Periodicals, Inc.     

Reducing false-positive rates in virtual screening via cancellation of systematic errors in the scoring function

Here we propose an over-the-hood docking method that compensates for systematic errors in the docking force fields. This method explicitly estimates the interaction energy of the ligand with the protein surface and uses it as a baseline to estimate the actual binding energy in the active site. It improves the accuracy of virtual screening in the LeadFinder package by up to 48%.     

Supercomputer docking with a large number of degrees of freedom

ABSTRACT

Docking represents one of the most popular computational approaches in drug design. It has reached popularity owing to capability of identifying correct conformations of a ligand within an active site of the target-protein and of estimating the binding affinity of a ligand that is immensely helpful in prediction of compound activity. Despite many success stories, there are challenges, in particular, handling with a large number of degrees of freedom in solving the docking problem. Here, we show that SOL-P, the docking program based on the new Tensor Train algorithm, is capable to dock successfully oligopeptides having up to 25 torsions. To make the study comparative we have performed docking of the same oligopeptides with the SOL program which uses the same force field as that utilized by SOL-P and has common features of many docking programs: the genetic algorithm of the global optimization and the grid approximation. SOL has managed to dock only one oligopeptide. Moreover, we present the results of docking with SOL-P ligands into proteins with moveable atoms. Relying on visual observations we have determined the common protein atom groups displaced after docking which seem to be crucial for successful prediction of experimental conformations of ligands.     

Development and evaluation of a generic evolutionary method for protein-ligand docking

We have developed a generic evolutionary method with an empirical scoring function for the protein-ligand docking, which is a problem of paramount importance in structure-based drug design. This approach, referred to as the GEMDOCK (Generic Evolutionary Method for molecular DOCKing), combines both continuous and discrete search mechanisms. We tested our approach on seven protein-ligand complexes, and the docked lowest energy structures have root-mean-square derivations ranging from 0.32 to 0.99 A with respect to the corresponding crystal ligand structures. In addition, we evaluated GEMDOCK on crossdocking experiments, in which some complexes with an identical protein used for docking all crystallized ligands of these complexes. GEMDOCK yielded 98% docked structures with RMSD below 2.0 A when the ligands were docked into foreign protein structures. We have reported the validation and analysis of our approach on various search spaces and scoring functions. Experimental results show that our approach is robust, and the empirical scoring function is simple and fast to recognize compounds. We found that if GEMDOCK used the RMSD scoring function, then the prediction accuracy was 100% and the docked structures had RMSD below 0.1 A for each test system. These results suggest that GEMDOCK is a useful tool, and may systematically improve the forms and parameters of a scoring function, which is one of major bottlenecks for molecular recognition.     

Knowledge-based interaction fingerprint scoring: a simple method for improving the effectiveness of fast scoring functions

A new method for the postprocessing of docking outputs has been developed, based on encoding putative 3D binding modes (docking solutions) as ligand-protein interactions into simple bit strings, a method analogous to the structural interaction fingerprint. Instead of employing traditional scoring functions, the method uses a series of new, knowledge-based scores derived from the similarity of the bit strings for each docking solution to that of a known reference binding mode. A GOLD docking study was carried out using the Bissantz estrogen receptor antagonist set along with the new scoring method. Superior recovery rates, with up to 2-fold enrichments, were observed when the new knowledge-based scoring was compared to the GOLD fitness score. In addition, top ranking sets of molecules (actives and potential actives or decoys) were structurally diverse with low molecular weights and structural complexities. Principal component analysis and clustering of the fingerprints permits the easy separation of active from inactive binding modes and the visualization of diverse binding modes.     

New and fast statistical-thermodynamic method for computation of protein-ligand binding entropy substantially improves docking accuracy

We present a novel method to estimate the contributions of translational and rotational entropy to protein-ligand binding affinity. The method is based on estimates of the configurational integral through the sizes of clusters obtained from multiple docking positions. Cluster sizes are defined as the intervals of variation of center of ligand mass and Euler angles in the cluster. Then we suggest a method to consider the entropy of torsional motions. We validate the suggested methods on a set of 135 PDB protein-ligand complexes by comparing the averaged root-mean square deviations (RMSD) of the top-scored ligand docked positions, accounting and not accounting for entropy contributions, relative to the experimentally determined positions. We demonstrate that the method increases docking accuracy by 10-21% when used in conjunction with the AutoDock docking program, thus reducing the percent of incorrectly docked ligands by 1.4-fold to four-fold, so that in some cases the percent of ligands correctly docked to within an RMSD of 2 A is above 90%. We show that the suggested method to account for entropy of relative motions is identical to the method based on the Monte Carlo integration over intervals of variation of center of ligand mass and Euler angles in the cluster.