SPOT‐Ligand: Fast and effective structure‐based virtual screening by binding homology search according to ligand and receptor similarity

Structure‐based virtual screening usually involves docking of a library of chemical compounds onto the functional pocket of the target receptor so as to discover novel classes of ligands. However, the overall success rate remains low and screening a large library is computationally intensive. An alternative to this “ab initio” approach is virtual screening by binding homology search. In this approach, potential ligands are predicted based on similar interaction pairs (similarity in receptors and ligands). SPOT‐Ligand is an approach that integrates ligand similarity by Tanimoto coefficient and receptor similarity by protein structure alignment program SPalign. The method was found to yield a consistent performance in DUD and DUD‐E docking benchmarks even if model structures were employed. It improves over docking methods (DOCK6 and AUTODOCK Vina) and has a performance comparable to or better than other binding‐homology methods (FINDsite and PoLi) with higher computational efficiency. The server is available at http://sparks-lab.org . © 2016 Wiley Periodicals, Inc.     

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     

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.     

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.     

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     

Molecular modelling prediction of ligand binding site flexibility

We have investigated the efficacy of generating multiple sidechain conformations using a rotamer library in order to find the experimentally observed ligand binding site conformation of a protein in the presence of a bound ligand. We made use of a recently published algorithm that performs an exhaustive conformational search using a rotamer library to enumerate all possible sidechain conformations in a binding site. This approach was applied to a dataset of proteins whose structures were determined by X-ray and NMR methods. All chosen proteins had two or more structures, generally involving different bound ligands. By taking one of these structures as a reference, we were able in most cases to successfully reproduce the experimentally determined conformations of the other structures, as well as to suggest alternative low-energy conformations of the binding site. In those few cases where this procedure failed, we observed that the bound ligand had induced a high-energy conformation of the binding site. These results suggest that for most proteins that exhibit limited backbone motion, ligands tend to bind to low energy conformations of their binding sites. Our results also reveal that it is possible in most cases to use a rotamer search-based approach to predict alternative low-energy protein binding site conformations that can be used by different ligands. This opens the possibility of incorporating alternative binding site conformations to improve the efficacy of docking and structure-based drug design algorithms.     

A Combination of Spin Diffusion Methods for the Determination of Protein–Ligand Complex Structural Ensembles

Structure‐based drug design (SBDD) is a powerful and widely used approach to optimize affinity of drug candidates. With the recently introduced INPHARMA method, the binding mode of small molecules to their protein target can be characterized even if no spectroscopic information about the protein is known. Here, we show that the combination of the spin‐diffusion‐based NMR methods INPHARMA, trNOE, and STD results in an accurate scoring function for docking modes and therefore determination of protein–ligand complex structures. Applications are shown on the model system protein kinase A and the drug targets glycogen phosphorylase and soluble epoxide hydrolase (sEH). Multiplexing of several ligands improves the reliability of the scoring function further. The new score allows in the case of sEH detecting two binding modes of the ligand in its binding site, which was corroborated by X‐ray analysis.     

Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function

A novel and robust automated docking method that predicts the bound conformations of flexible ligands to macromolecular targets has been developed and tested, in combination with a new scoring function that estimates the free energy change upon binding. Interestingly, this method applies a Lamarckian model of genetics, in which environmental adaptations of an individual's phenotype are reverse transcribed into its genotype and become heritable traits (sic). We consider three search methods, Monte Carlo simulated annealing, a traditional genetic algorithm, and the Lamarckian genetic algorithm, and compare their performance in dockings of seven protein–ligand test systems having known three-dimensional structure. We show that both the traditional and Lamarckian genetic algorithms can handle ligands with more degrees of freedom than the simulated annealing method used in earlier versions of AUTO DOCK , and that the Lamarckian genetic algorithm is the most efficient, reliable, and successful of the three. The empirical free energy function was calibrated using a set of 30 structurally known protein–ligand complexes with experimentally determined binding constants. Linear regression analysis of the observed binding constants in terms of a wide variety of structure-derived molecular properties was performed. The final model had a residual standard error of 9.11 kJ mol⁻¹ (2.177 kcal mol⁻¹) and was chosen as the new energy function. The new search methods and empirical free energy function are available in AUTO DOCK , version 3.0. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1639–1662, 1998     

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.     

Docking to heme proteins

In silico screening has become a valuable tool in drug design, but some drug targets represent real challenges for docking algorithms. This is especially true for metalloproteins, whose interactions with ligands are difficult to parametrize. Our docking algorithm, EADock, is based on the CHARMM force field, which assures a physically sound scoring function and a good transferability to a wide range of systems, but also exhibits difficulties in case of some metalloproteins. Here, we consider the therapeutically important case of heme proteins featuring an iron core at the active site. Using a standard docking protocol, where the iron–ligand interaction is underestimated, we obtained a success rate of 28% for a test set of 50 heme‐containing complexes with iron‐ligand contact. By introducing Morse‐like metal binding potentials (MMBP), which are fitted to reproduce density functional theory calculations, we are able to increase the success rate to 62%. The remaining failures are mainly due to specific ligand–water interactions in the X‐ray structures. Testing of the MMBP on a second data set of non iron binders (14 cases) demonstrates that they do not introduce a spurious bias towards metal binding, which suggests that they may reliably be used also for cross‐docking studies. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2009     

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     

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.     

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.     

Drug efficiency indices for improvement of molecular docking scoring functions

A dataset of protein‐drug complexes with experimental binding energy and crystal structure were analyzed and the performance of different docking engines and scoring functions (as well as components of these) for predicting the free energy of binding and several ligand efficiency indices were compared. The aim was not to evaluate the best docking method, but to determine the effect of different efficiency indices on the experimental and predicted free energy. Some ligand efficiency indices, such as ΔG/W (Wiener index), ΔG/NoC (number of carbons), and ΔG/P (partition coefficient), improve the correlation between experimental and calculated values. This effect was shown to be valid across the different scoring functions and docking programs. It also removes the common bias of scoring functions in favor of larger ligands. For all scoring functions, the efficiency indices effectively normalize the free energy derived indices, to give values closer to experiment. Compound collection filtering can be done prior or after docking, using pharmacokinetic as well as pharmacodynamic profiles. Achieving these better correlations with experiment can improve the ability of docking scoring functions to predict active molecules in virtual screening. © 2009 Wiley Periodicals, Inc. J Comput Chem 2010     

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.     

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.     

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     

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     

Reformulating the entropic contribution in molecular docking scoring functions

We have derived, in the context of the Rigid Rotor Harmonic Approximation (RRHO), a general mass and Planck's constant h independent expression for the dissociation free energy in ligand–receptor systems, featuring a systematically (anti‐binding) additive negative entropic term depending on readily available ligand–receptor quantities. The proposed RRHO expression allows to straightforwardly compute the absolute standard dissociation free energy without resorting to expensive normal mode analysis or other dynamical matrix‐based techniques for evaluating the entropic contribution, hence providing an effective scoring function for assessing docking poses with no adjustable parameters. Our RRHO formula was tested on a set of 55 ligand–receptor systems obtaining correlation coefficients and unsigned mean errors comparable to or better than those obtained with computationally demanding techniques for the dissociation entropy assessment. The proposed compact reformulation of the RRHO entropy term could constitute the basis for new and more effective scoring functions in molecular docking‐based high‐throughput virtual screening for drug discovery. © 2016 Wiley Periodicals, Inc.     

Protein‐protein docking by shape‐complementarity and property matching

We present a computational approach to protein‐protein docking based on surface shape complementarity (“ProBinder”). Within this docking approach, we implemented a new surface decomposition method that considers local shape features on the protein surface. This new surface shape decomposition results in a deterministic representation of curvature features on the protein surface, such as “knobs,” “holes,” and “flats” together with their point normals. For the actual docking procedure, we used geometric hashing, which allows for the rapid, translation‐, and rotation‐free comparison of point coordinates. Candidate solutions were scored based on knowledge‐based potentials and steric criteria. The potentials included electrostatic complementarity, desolvation energy, amino acid contact preferences, and a van‐der‐Waals potential. We applied ProBinder to a diverse test set of 68 bound and 30 unbound test cases compiled from the Dockground database. Sixty‐four percent of the protein‐protein test complexes were ranked with an root mean square deviation (RMSD) < 5 Å to the target solution among the top 10 predictions for the bound data set. In 82% of the unbound samples, docking poses were ranked within the top ten solutions with an RMSD < 10 Å to the target solution. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010