LEAP: Highly accurate prediction of protein loop conformations by integrating coarse‐grained sampling and optimized energy scores with all‐atom refinement of backbone and side chains

Prediction of protein loop conformations without any prior knowledge (ab initio prediction) is an unsolved problem. Its solution will significantly impact protein homology and template‐based modeling as well as ab initio protein‐structure prediction. Here, we developed a coarse‐grained, optimized scoring function for initial sampling and ranking of loop decoys. The resulting decoys are then further optimized in backbone and side‐chain conformations and ranked by all‐atom energy scoring functions. The final integrated technique called loop prediction by energy‐assisted protocol achieved a median value of 2.1 Å root mean square deviation (RMSD) for 325 12‐residue test loops and 2.0 Å RMSD for 45 12‐residue loops from critical assessment of structure‐prediction techniques (CASP) 10 target proteins with native core structures (backbone and side chains). If all side‐chain conformations in protein cores were predicted in the absence of the target loop, loop‐prediction accuracy only reduces slightly (0.2 Å difference in RMSD for 12‐residue loops in the CASP target proteins). The accuracy obtained is about 1 Å RMSD or more improvement over other methods we tested. The executable file for a Linux system is freely available for academic users at http://sparks‐lab.org . © 2013 Wiley Periodicals, Inc.     

GalaxyDock2: Protein–ligand docking using beta‐complex and global optimization

In this article, an enhanced version of GalaxyDock protein–ligand docking program is introduced. GalaxyDock performs conformational space annealing (CSA) global optimization to find the optimal binding pose of a ligand both in the rigid‐receptor mode and the flexible‐receptor mode. Binding pose prediction has been improved compared to the earlier version by the efficient generation of high‐quality initial conformations for CSA using a predocking method based on a beta‐complex derived from the Voronoi diagram of receptor atoms. Binding affinity prediction has also been enhanced by using the optimal combination of energy components, while taking into consideration the energy of the unbound ligand state. The new version has been tested in terms of binding mode prediction, binding affinity prediction, and virtual screening on several benchmark sets, showing improved performance over the previous version and AutoDock, on which the GalaxyDock energy function is based. GalaxyDock2 also performs better than or comparable to other state‐of‐the‐art docking programs. GalaxyDock2 is freely available at http://galaxy.seoklab.org/softwares/galaxydock.html . © 2013 Wiley Periodicals, Inc.     

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     

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.     

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     

sDFIRE: Sequence‐specific statistical energy function for protein structure prediction by decoy selections

An important unsolved problem in molecular and structural biology is the protein folding and structure prediction problem. One major bottleneck for solving this is the lack of an accurate energy to discriminate near‐native conformations against other possible conformations. Here we have developed sDFIRE energy function, which is an optimized linear combination of DFIRE (the Distance‐scaled Finite Ideal gas Reference state based Energy), the orientation dependent (polar‐polar and polar‐nonpolar) statistical potentials, and the matching scores between predicted and model structural properties including predicted main‐chain torsion angles and solvent accessible surface area. The weights for these scoring terms are optimized by three widely used decoy sets consisting of a total of 134 proteins. Independent tests on CASP8 and CASP9 decoy sets indicate that sDFIRE outperforms other state‐of‐the‐art energy functions in selecting near native structures and in the Pearson's correlation coefficient between the energy score and structural accuracy of the model (measured by TM‐score). © 2016 Wiley Periodicals, Inc.     

SDOCK: a global protein-protein docking program using stepwise force-field potentials

Fast Fourier transform (FFT) method limits the forms of scoring functions in global protein-protein docking. On the other hand, force field potentials can effectively describe the energy hyper surface of biological macromolecules. In this study, we developed a new protein-protein docking program, SDOCK, that incorporates van der Waals attractive potential, geometric collision, screened electrostatic potential, and Lazaridis-Karplus desolvation energy into the scoring function in the global searching process. Stepwise potentials were generated from the corresponding continuous forms to treat the structure flexibility. After optimization of the atom solvation parameters and the weights of different potential terms based on a new docking test set that contains 142 cases with small or moderate conformational changes upon binding, SDOCK slightly outperformed the well-known FFT based global docking program ZDOCK3.0. Among the 142 cases tested, 52.8% gave at least one near-native solutions in the top 100 solutions. SDOCK was also tested on six blind testing cases in Critical Assessment of Predicted Interactions rounds 13 to 18. In all six cases, the near-native solutions could be found within the top 350 solutions. Because the SDOCK approach performs global docking based on force-field potentials, one of its advantages is that it provides global binding free energy surface profiles for further analysis. The efficiency of the program is also comparable with that of other FFT based protein-protein docking programs. SDOCK is available for noncommercial applications at http://mdl.ipc.pku.edu.cn/cgi-bin/down.cgi.     

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.     

Flexible protein‐protein docking based on Best‐First search algorithm

We developed a new high resolution protein‐protein docking method based on Best‐First search algorithm that loosely imitates protein‐protein associations. The method operates in two stages: first, we perform a rigid search on the unbound proteins. Second, we search alternately on rigid and flexible degrees of freedom starting from multiple configurations from the rigid search. Both stages use heuristics added to the energy function, which causes the proteins to rapidly approach each other and remain adjacent, while optimizing on the energy. The method deals with backbone flexibility explicitly by searching over ensembles of conformations generated before docking. We ran the rigid docking stage on 66 complexes and grouped the results into four classes according to evaluation criteria used in Critical Assessment of Predicted Interactions (CAPRI; “high,” “medium,” “acceptable,” and “incorrect”). Our method found medium binding conformations for 26% of the complexes and acceptable for additional 44% among the top 10 configurations. Considering all the configurations, we found medium binding conformations for 55% of the complexes and acceptable for additional 39% of the complexes. Introducing side‐chains flexibility in the second stage improves the best found binding conformation but harms the ranking. However, introducing side‐chains and backbone flexibility improve both the best found binding conformation and the best found conformation in the top 10. Our approach is a basis for incorporating multiple flexible motions into protein‐protein docking and is of interest even with the current use of a simple energy function. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010     

LigDockCSA: protein-ligand docking using conformational space annealing

Protein–ligand docking techniques are one of the essential tools for structure‐based drug design. Two major components of a successful docking program are an efficient search method and an accurate scoring function. In this work, a new docking method called LigDockCSA is developed by using a powerful global optimization technique, conformational space annealing (CSA), and a scoring function that combines the AutoDock energy and the piecewise linear potential (PLP) torsion energy. It is shown that the CSA search method can find lower energy binding poses than the Lamarckian genetic algorithm of AutoDock. However, lower‐energy solutions CSA produced with the AutoDock energy were often less native‐like. The loophole in the AutoDock energy was fixed by adding a torsional energy term, and the CSA search on the refined energy function is shown to improve the docking performance. The performance of LigDockCSA was tested on the Astex diverse set which consists of 85 protein–ligand complexes. LigDockCSA finds the best scoring poses within 2 Å root‐mean‐square deviation (RMSD) from the native structures for 84.7% of the test cases, compared to 81.7% for AutoDock and 80.5% for GOLD. The results improve further to 89.4% by incorporating the conformational entropy. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011     

Exploring the parameter space of the coarse‐grained UNRES force field by random search: Selecting a transferable medium‐resolution force field

We explored the energy‐parameter space of our coarse‐grained UNRES force field for large‐scale ab initio simulations of protein folding, to obtain good initial approximations for hierarchical optimization of the force field with new virtual‐bond‐angle bending and side‐chain‐rotamer potentials which we recently introduced to replace the statistical potentials. 100 sets of energy‐term weights were generated randomly, and good sets were selected by carrying out replica‐exchange molecular dynamics simulations of two peptides with a minimal α‐helical and a minimal β‐hairpin fold, respectively: the tryptophan cage (PDB code: 1L2Y) and tryptophan zipper (PDB code: 1LE1). Eight sets of parameters produced native‐like structures of these two peptides. These eight sets were tested on two larger proteins: the engrailed homeodomain (PDB code: 1ENH) and FBP WW domain (PDB code: 1E0L); two sets were found to produce native‐like conformations of these proteins. These two sets were tested further on a larger set of nine proteins with α or α + β structure and found to locate native‐like structures of most of them. These results demonstrate that, in addition to finding reasonable initial starting points for optimization, an extensive search of parameter space is a powerful method to produce a transferable force field. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2009     

Structure-based virtual screening with supervised consensus scoring: evaluation of pose prediction and enrichment factors

Since the evaluation of ligand conformations is a crucial aspect of structure-based virtual screening, scoring functions play significant roles in it. However, it is known that a scoring function does not always work well for all target proteins. When one cannot know which scoring function works best against a target protein a priori, there is no standard scoring method to know it even if 3D structure of a target protein-ligand complex is available. Therefore, development of the method to achieve high enrichments from given scoring functions and 3D structure of protein-ligand complex is a crucial and challenging task. To address this problem, we applied SCS (supervised consensus scoring), which employs a rough linear correlation between the binding free energy and the root-mean-square deviation (rmsd) of a native ligand conformations and incorporates protein-ligand binding process with docked ligand conformations using supervised learning, to virtual screening. We evaluated both the docking poses and enrichments of SCS and five scoring functions (F-Score, G-Score, D-Score, ChemScore, and PMF) for three different target proteins: thymidine kinase (TK), thrombin (thrombin), and peroxisome proliferator-activated receptor gamma (PPARgamma). Our enrichment studies show that SCS is competitive or superior to a best single scoring function at the top ranks of screened database. We found that the enrichments of SCS could be limited by a best scoring function, because SCS is obtained on the basis of the five individual scoring functions. Therefore, it is concluded that SCS works very successfully from our results. Moreover, from docking pose analysis, we revealed the connection between enrichment and average centroid distance of top-scored docking poses. Since SCS requires only one 3D structure of protein-ligand complex, SCS will be useful for identifying new ligands.     

Flexible docking simulations: Scaled collective variable Monte Carlo minimization approach using Bezier splines,and comparison with a standard Monte Carlo algorithm

An algorithm for docking a flexible ligand onto a flexible or rigid receptor, using the scaled‐collective‐variables Monte Carlo with energy minimization approach, is presented. Energy minimization is shown to be one of the best techniques for distinguishing between native‐ and nonnative‐generated conformations. Incorporation of this technique into a Monte Carlo procedure enables one to distinguish the native conformation directly during the conformational search. It avoids the generation of a large number of ligand conformers for which more sophisticated energy evaluation tools would have had to be applied to identify the nativelike conformations. The efficiency of the Monte Carlo minimization was greatly improved by incorporating a new grid‐based energy evaluation technique using Bezier splines for which the energy function, as well as all of its derivatives, can be deduced from the values at the grid points. Comparison between our ECEPP/3‐based algorithm and the Monte Carlo algorithm presented elsewhere (Hart, T. N.; Read, R. J. Prot Struct Funct Genet 1992, 13, 206–222) has been made for docking NH₂ D Phe Pro Arg COOH, the noncovalent analog of NH₂ D Phe Pro Arg chloromethylketone (PPACK), onto the active site of human α‐thrombin. ©1999 John Wiley & Sons, Inc. J Comput Chem 20: 244–252, 1999     

A fast method for large‐scale De Novo peptide and miniprotein structure prediction

Although peptides have many biological and biomedical implications, an accurate method predicting their equilibrium structural ensembles from amino acid sequences and suitable for large‐scale experiments is still missing. We introduce a new approach—PEP‐FOLD—to the de novo prediction of peptides and miniproteins. It first predicts, in the terms of a Hidden Markov Model‐derived structural alphabet, a limited number of local conformations at each position of the structure. It then performs their assembly using a greedy procedure driven by a coarse‐grained energy score. On a benchmark of 52 peptides with 9–23 amino acids, PEP‐FOLD generates lowest‐energy conformations within 2.8 and 2.3 Å Cα root‐mean‐square deviation from the full nuclear magnetic resonance structures (NMR) and the NMR rigid cores, respectively, outperforming previous approaches. For 13 miniproteins with 27–49 amino acids, PEP‐FOLD reaches an accuracy of 3.6 and 4.6 Å Cα root‐mean‐square deviation for the most‐native and lowest‐energy conformations, using the nonflexible regions identified by NMR. PEP‐FOLD simulations are fast—a few minutes only—opening therefore, the door to in silico large‐scale rational design of new bioactive peptides and miniproteins. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

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     

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     

Ligand-biased ensemble receptor docking (LigBEnD): a hybrid ligand/receptor structure-based approach

Ligand docking to flexible protein molecules can be efficiently carried out through ensemble docking to multiple protein conformations, either from experimental X-ray structures or from in silico simulations. The success of ensemble docking often requires the careful selection of complementary protein conformations, through docking and scoring of known co-crystallized ligands. False positives, in which a ligand in a wrong pose achieves a better docking score than that of native pose, arise as additional protein conformations are added. In the current study, we developed a new ligand-biased ensemble receptor docking method and composite scoring function which combine the use of ligand-based atomic property field (APF) method with receptor structure-based docking. This method helps us to correctly dock 30 out of 36 ligands presented by the D3R docking challenge. For the six mis-docked ligands, the cognate receptor structures prove to be too different from the 40 available experimental Pocketome conformations used for docking and could be identified only by receptor sampling beyond experimentally explored conformational subspace.     

Structure‐based redesign of proteins for minimal T‐cell epitope content

The protein universe displays a wealth of therapeutically relevant activities, but T‐cell driven immune responses to non‐“self” biological agents present a major impediment to harnessing the full diversity of these molecular functions. Mutagenic T‐cell epitope deletion seeks to mitigate the immune response, but can typically address only a small number of epitopes. Here, we pursue a “bottom‐up” approach that redesigns an entire protein to remain native‐like but contain few if any immunogenic epitopes. We do so by extending the Rosetta flexible‐backbone protein design software with an epitope scoring mechanism and appropriate constraints. The method is benchmarked with a diverse panel of proteins and applied to three targets of therapeutic interest. We show that the deimmunized designs indeed have minimal predicted epitope content and are native‐like in terms of various quality measures, and moreover that they display levels of native sequence recovery comparable to those of non‐deimmunized designs. © 2013 Wiley Periodicals, Inc.