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     

Q‐DockLHM: Low‐resolution refinement for ligand comparative modeling

The success of ligand docking calculations typically depends on the quality of the receptor structure. Given improvements in protein structure prediction approaches, approximate protein models now can be routinely obtained for the majority of gene products in a given proteome. Structure‐based virtual screening of large combinatorial libraries of lead candidates against theoretically modeled receptor structures requires fast and reliable docking techniques capable of dealing with structural inaccuracies in protein models. Here, we present Q‐Dock^LHM, a method for low‐resolution refinement of binding poses provided by FINDSITE^LHM, a ligand homology modeling approach. We compare its performance to that of classical ligand docking approaches in ligand docking against a representative set of experimental (both holo and apo) as well as theoretically modeled receptor structures. Docking benchmarks reveal that unlike all‐atom docking, Q‐Dock^LHM exhibits the desired tolerance to the receptor's structure deformation. Our results suggest that the use of an evolution‐based approach to ligand homology modeling followed by fast low‐resolution refinement is capable of achieving satisfactory performance in ligand‐binding pose prediction with promising applicability to proteome‐scale applications. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

Assessing protein–ligand docking for the binding of organometallic compounds to proteins

Organometallic compounds are increasingly used as molecular scaffolds in drug development projects; their structural and electronic properties offering novel opportunities in protein–ligand complementarities. Interestingly, while protein–ligand dockings have long become a spearhead in computer assisted drug design, no benchmarking nor optimization have been done for their use with organometallic compounds. Pursuing our efforts to model metal mediated recognition processes, we herein present a systematic study of the capabilities of the program GOLD to predict the interactions of protein with organometallic compounds. The study focuses on inert systems for which no alteration of the first coordination sphere of the metal occurs upon binding. Several scaffolds are used as test systems with different docking schemes and scoring functions. We conclude that ChemScore is the most robust scoring function with ASP and ChemPLP providing with good results too and GoldScore slightly underperforming. This study shows that current state‐of‐the‐art protein‐ligand docking techniques are reliable for the docking of inert organometallic compounds binding to protein. © 2013 Wiley Periodicals, Inc.     

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.     

Flexible CDOCKER: Development and application of a pseudo‐explicit structure‐based docking method within CHARMM

Protein‐ligand docking is a commonly used method for lead identification and refinement. While traditional structure‐based docking methods represent the receptor as a rigid body, recent developments have been moving toward the inclusion of protein flexibility. Proteins exist in an interconverting ensemble of conformational states, but effectively and efficiently searching the conformational space available to both the receptor and ligand remains a well‐appreciated computational challenge. To this end, we have developed the Flexible CDOCKER method as an extension of the family of complete docking solutions available within CHARMM. This method integrates atomically detailed side chain flexibility with grid‐based docking methods, maintaining efficiency while allowing the protein and ligand configurations to explore their conformational space simultaneously. This is in contrast to existing approaches that use induced‐fit like sampling, such as Glide or Autodock, where the protein or the ligand space is sampled independently in an iterative fashion. Presented here are developments to the CHARMM docking methodology to incorporate receptor flexibility and improvements to the sampling protocol as demonstrated with re‐docking trials on a subset of the CCDC/Astex set. These developments within CDOCKER achieve docking accuracy competitive with or exceeding the performance of other widely utilized docking programs. © 2015 Wiley Periodicals, Inc.     

Prediction of the interaction of metallic moieties with proteins: An update for protein‐ligand docking techniques

In this article, we present a new approach to expand the range of application of protein‐ligand docking methods in the prediction of the interaction of coordination complexes (i.e., metallodrugs, natural and artificial cofactors, etc.) with proteins. To do so, we assume that, from a pure computational point of view, hydrogen bond functions could be an adequate model for the coordination bonds as both share directionality and polarity aspects. In this model, docking of metalloligands can be performed without using any geometrical constraints or energy restraints. The hard work consists in generating the convenient atom types and scoring functions. To test this approach, we applied our model to 39 high‐quality X‐ray structures with transition and main group metal complexes bound via a unique coordination bond to a protein. This concept was implemented in the protein‐ligand docking program GOLD. The results are in very good agreement with the experimental structures: the percentage for which the RMSD of the simulated pose is smaller than the X‐ray spectra resolution is 92.3% and the mean value of RMSD is < 1.0 Å. Such results also show the viability of the method to predict metal complexes–proteins interactions when the X‐ray structure is not available. This work could be the first step for novel applicability of docking techniques in medicinal and bioinorganic chemistry and appears generalizable enough to be implemented in most protein‐ligand docking programs nowadays available. © 2017 Wiley Periodicals, Inc.     

Blind docking method combining search of low‐resolution binding sites with ligand pose refinement by molecular dynamics‐based global optimization

This study describes the development of a new blind hierarchical docking method, bhDock, its implementation, and accuracy assessment. The bhDock method uses two‐step algorithm. First, a comprehensive set of low‐resolution binding sites is determined by analyzing entire protein surface and ranked by a simple score function. Second, ligand position is determined via a molecular dynamics‐based method of global optimization starting from a small set of high ranked low‐resolution binding sites. The refinement of the ligand binding pose starts from uniformly distributed multiple initial ligand orientations and uses simulated annealing molecular dynamics coupled with guided force‐field deformation of protein–ligand interactions to find the global minimum. Assessment of the bhDock method on the set of 37 protein–ligand complexes has shown the success rate of predictions of 78%, which is better than the rate reported for the most cited docking methods, such as AutoDock, DOCK, GOLD, and FlexX, on the same set of complexes. © 2009 Wiley Periodicals, Inc. J Comput Chem 2010     

A comprehensive docking study on the selectivity of binding of aromatic compounds to proteins

Generally, computer-aided drug design is focused on screening of ligand molecules for a single protein target. The screening of several proteins for a ligand is a relatively new application of molecular docking. In the present study, complexes from the Brookhaven Protein Databank were used to investigate a docking approach of protein screening. Automated molecular docking calculations were applied to reproduce 44 protein-aromatic ligand complexes (31 different proteins and 39 different ligand molecules) of the databank. All ligands were docked to all different protein targets in altogether 12090 docking runs. Based on the results of the extensive docking simulations, two relative measures, the molecular interaction fingerprint (MIF) and the molecular affinity fingerprint (MAF), were introduced to describe the selectivity of aromatic ligands to different proteins. MIF and MAF patterns are in agreement with fragment and similarity considerations. Limitations and future extension of our approach are discussed.     

Computer simulations of ligand–protein binding with ensembles of protein conformations: A Monte Carlo study of HIV‐1 protease binding energy landscapes

We present the results of molecular docking simulations with HIV‐1 protease for the sb203386 and skf107457 inhibitors by Monte Carlo simulated annealing. A simplified piecewise linear energy function, the standard AMBER force field, and the AMBER force field with solvation and a soft‐core smoothing component are employed in simulations with a single‐protein conformation to determine the relationship between docking simulations with a simple energy function and more realistic force fields. The temperature‐dependent binding free energy profiles of the inhibitors interacting with a single protein conformation provide a detailed picture of relative thermodynamic stability and a distribution of ligand binding modes in agreement with experimental crystallographic data. Using the simplified piecewise linear energy function, we also performed Monte Carlo docking simulations with an ensemble of protein conformations employing preferential biased sampling of low‐energy protein conformations, and the results are analyzed in connection with the free energy profiles. ©1999 John Wiley & Sons, Inc. Int J Quant Chem 72: 73–84, 1999     

Focused grid‐based resampling for protein docking and mapping

The fast Fourier transform (FFT) sampling algorithm has been used with success in application to protein‐protein docking and for protein mapping, the latter docking a variety of small organic molecules for the identification of binding hot spots on the target protein. Here we explore the local rather than global usage of the FFT sampling approach in docking applications. If the global FFT based search yields a near‐native cluster of docked structures for a protein complex, then focused resampling of the cluster generally leads to a substantial increase in the number of conformations close to the native structure. In protein mapping, focused resampling of the selected hot spot regions generally reveals further hot spots that, while not as strong as the primary hot spots, also contribute to ligand binding. The detection of additional ligand binding regions is shown by the improved overlap between hot spots and bound ligands. © 2016 Wiley Periodicals, Inc.     

Evaluation of a knowledge‐based potential of mean force for scoring docked protein–ligand complexes

The Biomolecular Ligand Energy Evaluation Protocol (BLEEP) is a knowledge‐based potential derived from high‐resolution X‐ray structures of protein–ligand complexes. The performance of this potential in ranking the hypothetical structures resulting from a docking study has been evaluated using fifteen protein–ligand complexes from the Protein Data Bank. In the majority of complexes BLEEP was successful in identifying the native (experimental) binding mode or an alternative of low rms deviation (from the native) as the lowest in energy. Overall BLEEP is slightly better than the DOCK energy function in discriminating native‐like modes. Even when alternative binding modes rank lower than the native structure, a reasonable energy is assigned to the latter. Breaking down the BLEEP scores into the atom–atom contributions reveals that this type of potential is grossly dominated by longer range interactions (>5 Å), which makes it relatively insensitive to small local variations in the binding site. However, despite this limitation, the lack, at present, of accurate protein–ligand potentials means that BLEEP is a promising approach to improve the filtering of structures resulting from docking programs. Moreover, BLEEP should improve with the continuously increasing number of complexes available in the PDB. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 673–688, 2001     

VoteDock: Consensus docking method for prediction of protein–ligand interactions

Molecular recognition plays a fundamental role in all biological processes, and that is why great efforts have been made to understand and predict protein–ligand interactions. Finding a molecule that can potentially bind to a target protein is particularly essential in drug discovery and still remains an expensive and time‐consuming task. In silico, tools are frequently used to screen molecular libraries to identify new lead compounds, and if protein structure is known, various protein–ligand docking programs can be used. The aim of docking procedure is to predict correct poses of ligand in the binding site of the protein as well as to score them according to the strength of interaction in a reasonable time frame. The purpose of our studies was to present the novel consensus approach to predict both protein–ligand complex structure and its corresponding binding affinity. Our method used as the input the results from seven docking programs (Surflex, LigandFit, Glide, GOLD, FlexX, eHiTS, and AutoDock) that are widely used for docking of ligands. We evaluated it on the extensive benchmark dataset of 1300 protein–ligands pairs from refined PDBbind database for which the structural and affinity data was available. We compared independently its ability of proper scoring and posing to the previously proposed methods. In most cases, our method is able to dock properly approximately 20% of pairs more than docking methods on average, and over 10% of pairs more than the best single program. The RMSD value of the predicted complex conformation versus its native one is reduced by a factor of 0.5 Å. Finally, we were able to increase the Pearson correlation of the predicted binding affinity in comparison with the experimental value up to 0.5. © 2010 Wiley Periodicals, Inc. J Comput Chem 32: 568–581, 2011     

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     

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.     

DOX: A new computational protocol for accurate prediction of the protein–ligand binding structures

Molecular docking techniques have now been widely used to predict the protein–ligand binding modes, especially when the structures of crystal complexes are not available. Most docking algorithms are able to effectively generate and rank a large number of probable binding poses. However, it is hard for them to accurately evaluate these poses and identify the most accurate binding structure. In this study, we first examined the performance of some docking programs, based on a testing set made of 15 crystal complexes with drug statins for the human 3‐hydroxy‐3‐methylglutaryl coenzyme A reductase (HMGR). We found that most of the top ranking HMGR–statin binding poses, predicted by the docking programs, were energetically unstable as revealed by the high theoretical‐level calculations, which were usually accompanied by the large deviations from the geometric parameters of the corresponding crystal binding structures. Subsequently, we proposed a new computational protocol, DOX, based on the joint use of molecular Docking, ONIOM, and eXtended ONIOM (XO) methods to predict the accurate binding structures for the protein–ligand complexes of interest. Our testing results demonstrate that the DOX protocol can efficiently predict accurate geometries for all 15 HMGR‐statin crystal complexes without exception. This study suggests a promising computational route, as an effective alternative to the experimental one, toward predicting the accurate binding structures, which is the prerequisite for all the deep understandings of the properties, functions, and mechanisms of the protein–ligand complexes. © 2015 Wiley Periodicals, Inc.     

Power transformations improve interpolation of grids for molecular mechanics interaction energies

A common strategy for speeding up molecular docking calculations is to precompute nonbonded interaction energies between a receptor molecule and a set of three‐dimensional grids. The grids are then interpolated to compute energies for ligand atoms in many different binding poses. Here, I evaluate a smoothing strategy of taking a power transformation of grid point energies and inverse transformation of the result from trilinear interpolation. For molecular docking poses from 85 protein‐ligand complexes, this smoothing procedure leads to significant accuracy improvements, including an approximately twofold reduction in the root mean square error at a grid spacing of 0.4 Å and retaining the ability to rank docking poses even at a grid spacing of 0.7 Å. © 2018 Wiley Periodicals, Inc.     

Search for approaches to improving the calculation accuracy of the protein—ligand binding energy by docking

The following reasons limiting the accuracy of calculations of the protein—ligand binding energy by the molecular docking programs are considered: the limited facilities of algorithms of finding a global minimum on a complicated multi-dimensional protein—ligand energy surface, restrictions on the degrees of freedom of a protein—ligand system including docking into a rigid protein, inadequacy of the existing force fields, a lack of taking into account the solvent or too rough allowance for the solvent in the docking procedure, a lack of the local energy optimization in the docking process, an inaccuracy of the construction of models of a target protein and a ligand, simplification of the calculation method of the Gibbs free energy of a molecular system, and limited computer resources for docking of one ligand. A new approach to the development of the new generation of docking programs is proposed. The approach allows one to remove step-by-step the existing simplifications and to increase considerably the accuracy of the whole docking process, including the calculation accuracy of the protein—ligand binding energy. The results of the study are presented and demonstrate the computational feasibility of the assigned docking problem.