PIE—Efficient filters and coarse grained potentials for unbound protein–protein docking

Identifying correct binding modes in a large set of models is an important step in protein–protein docking. We identified protein docking filter based on overlap area that significantly reduces the number of candidate structures that require detailed examination. We also developed potentials based on residue contacts and overlap areas using a comprehensive learning set of 640 two‐chain protein complexes with mathematical programming. Our potential showed substantially better recognition capacity compared to other publicly accessible protein docking potentials in discriminating between native and nonnative binding modes on a large test set of 84 complexes independent of our training set. We were able to rank a near‐native model on the top in 43 cases and within top 10 in 51 cases. We also report an atomic potential that ranks a near‐native model on the top in 46 cases and within top 10 in 58 cases. Our filter+potential is well suited for selecting a small set of models to be refined to atomic resolution. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

Free energies for coarse-grained proteins by integrating multibody statistical contact potentials with entropies from elastic network models

We propose a novel method of calculation of free energy for coarse grained models of proteins by combining our newly developed multibody potentials with entropies computed from elastic network models of proteins. Multi-body potentials have been of much interest recently because they take into account three dimensional interactions related to residue packing and capture the cooperativity of these interactions in protein structures. Combining four-body non-sequential, four-body sequential and pairwise short range potentials with optimized weights for each term, our coarse-grained potential improved recognition of native structure among misfolded decoys, outperforming all other contact potentials for CASP8 decoy sets and performance comparable to the fully atomic empirical DFIRE potentials. By combing statistical contact potentials with entropies from elastic network models of the same structures we can compute free energy changes and improve coarse-grained modeling of protein structure and dynamics. The consideration of protein flexibility and dynamics should improve protein structure prediction and refinement of computational models. This work is the first to combine coarse-grained multibody potentials with an entropic model that takes into account contributions of the entire structure, investigating native-like decoy selection.     

A comparative analysis of the equilibrium dynamics of a designed protein inferred from NMR,X‐ray,and computations

A detailed analysis of high‐resolution structural data and computationally predicted dynamics was carried out for a designed sugar‐binding protein. The mean‐square deviations in the positions of residues derived from nuclear magnetic resonance (NMR) models and those inferred from X‐ray crystallographic B‐factors for two different crystal forms were compared with the predictions based on the Gaussian Network Model (GNM) and the results from molecular dynamics (MD) simulations. GNM systematically yielded a higher correlation than MD, with experimental data, suggesting that the lack of atomistic details in the coarse‐grained GNM is more than compensated for by the mathematically exact evaluation of fluctuations using the native contacts topology. Evidence is provided that particular loop motions are curtailed by intermolecular contacts in the crystal environment causing a discrepancy between theory and experiments. Interestingly, the information conveyed by X‐ray crystallography becomes more consistent with NMR models and computational predictions when ensembles of X‐ray models are considered. Less precise (broadly distributed) ensembles indeed appear to describe the accessible conformational space under native state conditions better than B‐factors. Our results highlight the importance of using multiple conformations obtained by alternative experimental methods, and analyzing results from both coarse‐grained models and atomic simulations, for accurate assessment of motions accessible to proteins under native state conditions. Proteins 2009. © 2009 Wiley‐Liss, Inc.     

蛋白质-蛋白质对接中打分函数的研究

通过分析蛋白质－蛋白质间的静电、疏水作用和熵效应与相对于晶体结构的蛋白质主链原子的均方根偏差（RMSD）的相关性,定量地考查了它们在蛋白质－蛋白质对接中作为打分函数评价近天然构象的能力。对7个蛋白质复合物体系的分析表明,就水化能而言,原子接触势模型（ACE）优于原子水化参数模型（ASP）,且修正的ACE模型具有更好的评价近天然构象的能力;水化能与静电能结合对评价能力有进一步的提高。最后,我们将静电和修正的ACE水化能结合作为打分函数用于36个蛋白质复合物体系的对接研究,进一步证实了这两种能量项的组合能有效地将近天然结构从分子对接模式中区分出来。     

Protein structure refinement by optimization

Knowledge‐based protein potentials are simplified potentials designed to improve the quality of protein models, which is important as more accurate models are more useful for biological and pharmaceutical studies. Consequently, knowledge‐based potentials often are designed to be efficient in ordering a given set of deformed structures denoted decoys according to how close they are to the relevant native protein structure. This, however, does not necessarily imply that energy minimization of this potential will bring the decoys closer to the native structure. In this study, we introduce an iterative strategy to improve the convergence of decoy structures. It works by adding energy optimized decoys to the pool of decoys used to construct the next and improved knowledge‐based potential. We demonstrate that this strategy results in significantly improved decoy convergence on Titan high resolution decoys and refinement targets from Critical Assessment of protein Structure Prediction competitions. Our potential is formulated in Cartesian coordinates and has a fixed backbone potential to restricts motions to be close to those of a dihedral model, a fixed hydrogen‐bonding potential and a variable coarse grained carbon alpha potential consisting of a pair potential and a novel solvent potential that are b‐spline based as we use explicit gradient and Hessian for efficient energy optimization. Proteins 2015; 83:1616–1624. © 2015 Wiley Periodicals, Inc.     

Sampling and scoring: A marriage made in heaven

Most structure prediction algorithms consist of initial sampling of the conformational space, followed by rescoring and possibly refinement of a number of selected structures. Here we focus on protein docking, and show that while decoupling sampling and scoring facilitates method development, integration of the two steps can lead to substantial improvements in docking results. Since decoupling is usually achieved by generating a decoy set containing both non‐native and near‐native docked structures, which can be then used for scoring function construction, we first review the roles and potential pitfalls of decoys in protein–protein docking, and show that some type of decoys are better than others for method development. We then describe three case studies showing that complete decoupling of scoring from sampling is not the best choice for solving realistic docking problems. Although some of the examples are based on our own experience, the results of the CAPRI docking and scoring experiments also show that performing both sampling and scoring generally yields better results than scoring the structures generated by all predictors. Next we investigate how the selection of training and decoy sets affects the performance of the scoring functions obtained. Finally, we discuss pathways to better alignment of the two steps, and show some algorithms that achieve a certain level of integration. Although we focus on protein–protein docking, our observations most likely also apply to other conformational search problems, including protein structure prediction and the docking of small molecules to proteins.Proteins 2013; 81:1874–1884. © 2013 Wiley Periodicals, Inc.     

Combination of scoring functions improves discrimination in protein-protein docking

Two structure-based potentials are used for both filtering (i.e., selecting a subset of conformations generated by rigid-body docking), and rescoring and ranking the selected conformations. ACP (atomic contact potential) is an atom-level extension of the Miyazawa-Jernigan potential parameterized on protein structures, whereas RPScore (residue pair potential score) is a residue-level potential, based on interactions in protein-protein complexes. These potentials are combined with other energy terms and applied to 13 sets of protein decoys, as well as to the results of docking 10 pairs of unbound proteins. For both potentials, the ability to discriminate between near-native and non-native docked structures is substantially improved by refining the structures and by adding a van der Waals energy term. It is observed that ACP and RPScore complement each other in a number of ways (e.g., although RPScore yields more hits than ACP, mainly as a result of its better performance for charged complexes, ACP usually ranks the near-native complexes better). As a general solution to the protein-docking problem, we have found that the best discrimination strategies combine either an RPScore filter with an ACP-based scoring function, or an ACP-based filter with an RPScore-based scoring function. Thus, ACP and RPScore capture complementary structural information, and combining them in a multistage postprocessing protocol provides substantially better discrimination than the use of the same potential for both filtering and ranking the docked conformations.     

The role of atomic level steric effects and attractive forces in protein folding

Protein folding into tertiary structures is controlled by an interplay of attractive contact interactions and steric effects. We investigate the balance between these contributions using structure‐based models using an all‐atom representation of the structure combined with a coarse‐grained contact potential. Tertiary contact interactions between atoms are collected into a single broad attractive well between the C^β atoms between each residue pair in a native contact. Through the width of these contact potentials we control their tolerance for deviations from the ideal structure and the spatial range of attractive interactions. In the compact native state dominant packing constraints limit the effects of a coarse‐grained contact potential. During folding, however, the broad attractive potentials allow an early collapse that starts before the native local structure is completely adopted. As a consequence the folding transition is broadened and the free energy barrier is decreased. Eventually two‐state folding behavior is lost completely for systems with very broad attractive potentials. The stabilization of native‐like residue interactions in non‐perfect geometries early in the folding process frequently leads to structural traps. Global mirror images are a notable example. These traps are penalized by the details of the repulsive interactions only after further collapse. Successful folding to the native state requires simultaneous guidance from both attractive and repulsive interactions. Proteins 2012. © 2011 Wiley Periodicals, Inc.     

Integrating atom-based and residue-based scoring functions for protein-protein docking

Most scoring functions for protein-protein docking algorithms are either atom-based or residue-based, with the former being able to produce higher quality structures and latter more tolerant to conformational changes upon binding. Earlier, we developed the ZRANK algorithm for reranking docking predictions, with a scoring function that contained only atom-based terms. Here we combine ZRANK's atom-based potentials with five residue-based potentials published by other labs, as well as an atom-based potential IFACE that we published after ZRANK. We simultaneously optimized the weights for selected combinations of terms in the scoring function, using decoys generated with the protein-protein docking algorithm ZDOCK. We performed rigorous cross validation of the combinations using 96 test cases from a docking benchmark. Judged by the integrative success rate of making 1000 predictions per complex, addition of IFACE and the best residue-based pair potential reduced the number of cases without a correct prediction by 38 and 27% relative to ZDOCK and ZRANK, respectively. Thus combination of residue-based and atom-based potentials into a scoring function can improve performance for protein-protein docking. The resulting scoring function is called IRAD (integration of residue- and atom-based potentials for docking) and is available at http://zlab.umassmed.edu.     

Docking and scoring with alternative side-chain conformations

We describe a scoring and modeling procedure for docking ligands into protein models that have either modeled or flexible side-chain conformations. Our methodical contribution comprises a procedure for generating new potentials of mean force for the ROTA scoring function which we have introduced previously for optimizing side-chain conformations with the tool IRECS. The ROTA potentials are specially trained to tolerate small-scale positional errors of atoms that are characteristic of (i) side-chain conformations that are modeled using a sparse rotamer library and (ii) ligand conformations that are generated using a docking program. We generated both rigid and flexible protein models with our side-chain prediction tool IRECS and docked ligands to proteins using the scoring function ROTA and the docking programs FlexX (for rigid side chains) and FlexE (for flexible side chains). We validated our approach on the forty screening targets of the DUD database. The validation shows that the ROTA potentials are especially well suited for estimating the binding affinity of ligands to proteins. The results also show that our procedure can compensate for the performance decrease in screening that occurs when using protein models with side chains modeled with a rotamer library instead of using X-ray structures. The average runtime per ligand of our method is 168 seconds on an Opteron V20z, which is fast enough to allow virtual screening of compound libraries for drug candidates.     

DynaDock: A new molecular dynamics‐based algorithm for protein–peptide docking including receptor flexibility

Molecular docking programs play an important role in drug development and many well‐established methods exist. However, there are two situations for which the performance of most approaches is still not satisfactory, namely inclusion of receptor flexibility and docking of large, flexible ligands like peptides. In this publication a new approach is presented for docking peptides into flexible receptors. For this purpose a two step procedure was developed: first, the protein–peptide conformational space is scanned and approximate ligand poses are identified and second, the identified ligand poses are refined by a new molecular dynamics‐based method, optimized potential molecular dynamics (OPMD). The OPMD approach uses soft‐core potentials for the protein–peptide interactions and applies a new optimization scheme to the soft‐core potential. Comparison with refinement results obtained by conventional molecular dynamics and a soft‐core scaling approach shows significant improvements in the sampling capability for the OPMD method. Thus, the number of starting poses needed for successful refinement is much lower than for the other methods. The algorithm was evaluated on 15 protein–peptide complexes with 2–16mer peptides. Docking poses with peptide RMSD values <2.10 Å from the equilibrated experimental structures were obtained in all cases. For four systems docking into the unbound receptor structures was performed, leading to peptide RMSD values <2.12 Å. Using a specifically fitted scoring function in 11 of 15 cases the best scoring poses featured a peptide RMSD ≤2.10 Å. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

A simple probabilistic model of multibody interactions in proteins

Protein structure prediction methods typically use statistical potentials, which rely on statistics derived from a database of know protein structures. In the vast majority of cases, these potentials involve pairwise distances or contacts between amino acids or atoms. Although some potentials beyond pairwise interactions have been described, the formulation of a general multibody potential is seen as intractable due to the perceived limited amount of data. In this article, we show that it is possible to formulate a probabilistic model of higher order interactions in proteins, without arbitrarily limiting the number of contacts. The success of this approach is based on replacing a naive table‐based approach with a simple hierarchical model involving suitable probability distributions and conditional independence assumptions. The model captures the joint probability distribution of an amino acid and its neighbors, local structure and solvent exposure. We show that this model can be used to approximate the conditional probability distribution of an amino acid sequence given a structure using a pseudo‐likelihood approach. We verify the model by decoy recognition and site‐specific amino acid predictions. Our coarse‐grained model is compared to state‐of‐art methods that use full atomic detail. This article illustrates how the use of simple probabilistic models can lead to new opportunities in the treatment of nonlocal interactions in knowledge‐based protein structure prediction and design. Proteins 2013; 81:1340–1350. © 2013 Wiley Periodicals, Inc.     

Refining homology models by combining replica-exchange molecular dynamics and statistical potentials

A protocol is presented for the global refinement of homology models of proteins. It combines the advantages of temperature-based replica-exchange molecular dynamics (REMD) for conformational sampling and the use of statistical potentials for model selection. The protocol was tested using 21 models. Of these 14 were models of 10 small proteins for which high-resolution crystal structures were available, the remainder were targets of the recent CASPR exercise. It was found that REMD in combination with currently available force fields could sample near-native conformational states starting from high-quality homology models. Conformations in which the backbone RMSD of secondary structure elements (SSE-RMSD) was lower than the starting value by 0.5-1.0 A were found for 15 out of the 21 cases (average 0.82 A). Furthermore, when a simple scoring function consisting of two statistical potentials was used to rank the structures, one or more structures with SSE-RMSD of at least 0.2 A lower than the starting value was found among the five best ranked structures in 11 out of the 21 cases. The average improvement in SSE-RMSD for the best models was 0.42 A. However, none of the scoring functions tested identified the structures with the lowest SSE-RMSD as the best models although all identified the native conformation as the one with lowest energy. This suggests that while the proposed protocol proved effective for the refinement of high-quality models of small proteins scoring functions remain one of the major limiting factors in structure refinement. This and other aspects by which the methodology could be further improved are discussed.     

How noise in force fields can affect the structural refinement of protein models?

Structural refinement of predicted models of biological macromolecules using atomistic or coarse‐grained molecular force fields having various degree of error is investigated. The goal of this analysis is to estimate what is the probability for designing an effective structural refinement based on computations of conformational energies using force field, and starting from a structure predicted from the sequence (using template‐based or template‐free modeling), and refining it to bring the structure into closer proximity to the native state. It is widely believed that it should be possible to develop such a successful structure refinement algorithm by applying an iterative procedure with stochastic sampling and appropriate energy function, which assesses the quality (correctness) of protein decoys. Here, an analysis of noise in an artificially introduced scoring function is investigated for a model of an ideal sampling scheme, where the underlying distribution of RMSDs is assumed to be Gaussian. Sampling of the conformational space is performed by random generation of RMSD values. We demonstrate that whenever the random noise in a force field exceeds some level, it is impossible to obtain reliable structural refinement. The magnitude of the noise, above which a structural refinement, on average is impossible, depends strongly on the quality of sampling scheme and a size of the protein. Finally, possible strategies to overcome the intrinsic limitations in the force fields for impacting the development of successful refinement algorithms are discussed. Proteins 2012. © 2011 Wiley Periodicals, Inc.     

A combination of rescoring and refinement significantly improves protein docking performance

To determine the structures of protein-protein interactions, protein docking is a valuable tool that complements experimental methods to characterize protein complexes. Although protein docking can often produce a near-native solution within a set of global docking predictions, there are sometimes predictions that require refinement to elucidate correct contacts and conformation. Previously, we developed the ZRANK algorithm to rerank initial docking predictions from ZDOCK, a docking program developed by our lab. In this study, we have applied the ZRANK algorithm toward refinement of protein docking models in conjunction with the protein docking program RosettaDock. This was performed by reranking global docking predictions from ZDOCK, performing local side chain and rigid-body refinement using RosettaDock, and selecting the refined model based on ZRANK score. For comparison, we examined using RosettaDock score instead of ZRANK score, and a larger perturbation size for the RosettaDock search, and determined that the larger RosettaDock perturbation size with ZRANK scoring was optimal. This method was validated on a protein-protein docking benchmark. For refining docking benchmark predictions from the newest ZDOCK version, this led to improved structures of top-ranked hits in 20 of 27 cases, and an increase from 23 to 27 cases with hits in the top 20 predictions. Finally, we optimized the ZRANK energy function using refined models, which provides a significant improvement over the original ZRANK energy function. Using this optimized function and the refinement protocol, the numbers of cases with hits ranked at number one increased from 12 to 19 and from 7 to 15 for two different ZDOCK versions. This shows the effective combination of independently developed docking protocols (ZDOCK/ZRANK, and RosettaDock), indicating that using diverse search and scoring functions can improve protein docking results.     

Mimicking the action of folding chaperones by Hamiltonian replica-exchange molecular dynamics simulations: application in the refinement of de novo models

The efficiency of using a variant of Hamiltonian replica‐exchange molecular dynamics (Chaperone H‐replica‐exchange molecular dynamics [CH‐REMD]) for the refinement of protein structural models generated de novo is investigated. In CH‐REMD, the interaction between the protein and its environment, specifically, the electrostatic interaction between the protein and the solvating water, is varied leading to cycles of partial unfolding and refolding mimicking some aspects of folding chaperones. In 10 of the 15 cases examined, the CH‐REMD approach sampled structures in which the root‐mean‐square deviation (RMSD) of secondary structure elements (SSE‐RMSD) with respect to the experimental structure was more than 1.0 Å lower than the initial de novo model. In 14 of the 15 cases, the improvement was more than 0.5 Å. The ability of three different statistical potentials to identify near‐native conformations was also examined. Little correlation between the SSE‐RMSD of the sampled structures with respect to the experimental structure and any of the scoring functions tested was found. The most effective scoring function tested was the DFIRE potential. Using the DFIRE potential, the SSE‐RMSD of the best scoring structures was on average 0.3 Å lower than the initial model. Overall the work demonstrates that targeted enhanced‐sampling techniques such as CH‐REMD can lead to the systematic refinement of protein structural models generated de novo but that improved potentials for the identification of near‐native structures are still needed. Proteins 2012; © 2012 Wiley Periodicals, Inc.     

Structure refinement of membrane proteins via molecular dynamics simulations

A refinement protocol based on physics‐based techniques established for water soluble proteins is tested for membrane protein structures. Initial structures were generated by homology modeling and sampled via molecular dynamics simulations in explicit lipid bilayer and aqueous solvent systems. Snapshots from the simulations were selected based on scoring with either knowledge‐based or implicit membrane‐based scoring functions and averaged to obtain refined models. The protocol resulted in consistent and significant refinement of the membrane protein structures similar to the performance of refinement methods for soluble proteins. Refinement success was similar between sampling in the presence of lipid bilayers and aqueous solvent but the presence of lipid bilayers may benefit the improvement of lipid‐facing residues. Scoring with knowledge‐based functions (DFIRE and RWplus) was found to be as good as scoring using implicit membrane‐based scoring functions suggesting that differences in internal packing is more important than orientations relative to the membrane during the refinement of membrane protein homology models.