Princeton_TIGRESS: Protein geometry refinement using simulations and support vector machines

Protein structure refinement aims to perform a set of operations given a predicted structure to improve model quality and accuracy with respect to the native in a blind fashion. Despite the numerous computational approaches to the protein refinement problem reported in the previous three CASPs, an overwhelming majority of methods degrade models rather than improve them. We initially developed a method tested using blind predictions during CASP10 which was officially ranked in 5th place among all methods in the refinement category. Here, we present Princeton_TIGRESS, which when benchmarked on all CASP 7,8,9, and 10 refinement targets, simultaneously increased GDT_TS 76% of the time with an average improvement of 0.83 GDT_TS points per structure. The method was additionally benchmarked on models produced by top performing three‐dimensional structure prediction servers during CASP10. The robustness of the Princeton_TIGRESS protocol was also tested for different random seeds. We make the Princeton_TIGRESS refinement protocol freely available as a web server at http://atlas.princeton.edu/refinement . Using this protocol, one can consistently refine a prediction to help bridge the gap between a predicted structure and the actual native structure. Proteins 2014; 82:794–814. © 2013 Wiley Periodicals, Inc.     

Balancing exploration and exploitation in population‐based sampling improves fragment‐based de novo protein structure prediction

Conformational search space exploration remains a major bottleneck for protein structure prediction methods. Population‐based meta‐heuristics typically enable the possibility to control the search dynamics and to tune the balance between local energy minimization and search space exploration. EdaFold is a fragment‐based approach that can guide search by periodically updating the probability distribution over the fragment libraries used during model assembly. We implement the EdaFold algorithm as a Rosetta protocol and provide two different probability update policies: a cluster‐based variation (EdaRose_c) and an energy‐based one (EdaRose_en). We analyze the search dynamics of our new Rosetta protocols and show that EdaRose_c is able to provide predictions with lower C RMSD to the native structure than EdaRose_en and Rosetta AbInitio Relax protocol. Our software is freely available as a C++ patch for the Rosetta suite and can be downloaded from http://www.riken.jp/zhangiru/software/ . Our protocols can easily be extended in order to create alternative probability update policies and generate new search dynamics. Proteins 2017; 85:852–858. © 2016 Wiley Periodicals, Inc.     

Molprobity's ultimate rotamer‐library distributions for model validation

Here we describe the updated MolProbity rotamer‐library distributions derived from an order‐of‐magnitude larger and more stringently quality‐filtered dataset of about 8000 (vs. 500) protein chains, and we explain the resulting changes and improvements to model validation as seen by users. To include only side‐chains with satisfactory justification for their given conformation, we added residue‐specific filters for electron‐density value and model‐to‐density fit. The combined new protocol retains a million residues of data, while cleaning up false‐positive noise in the multi‐ datapoint distributions. It enables unambiguous characterization of conformational clusters nearly 1000‐fold less frequent than the most common ones. We describe examples of local interactions that favor these rare conformations, including the role of authentic covalent bond‐angle deviations in enabling presumably strained side‐chain conformations. Further, along with favored and outlier, an allowed category (0.3–2.0% occurrence in reference data) has been added, analogous to Ramachandran validation categories. The new rotamer distributions are used for current rotamer validation in MolProbity and PHENIX, and for rotamer choice in PHENIX model‐building and refinement. The multi‐dimensional distributions and Top8000 reference dataset are freely available on GitHub. These rotamers are termed “ultimate” because data sampling and quality are now fully adequate for this task, and also because we believe the future of conformational validation should integrate side‐chain with backbone criteria. Proteins 2016; 84:1177–1189. © 2016 Wiley Periodicals, Inc.     

Template‐free protein structure prediction and quality assessment with an all‐atom free‐energy model

Biophysical forcefields have contributed less than originally anticipated to recent progress in protein structure prediction. Here, we have investigated the selectivity of a recently developed all‐atom free‐energy forcefield for protein structure prediction and quality assessment (QA). Using a heuristic method, but excluding homology, we generated decoy‐sets for all targets of the CASP7 protein structure prediction assessment with <150 amino acids. The decoys in each set were then ranked by energy in short relaxation simulations and the best low‐energy cluster was submitted as a prediction. For four of nine template‐free targets, this approach generated high‐ranking predictions within the top 10 models submitted in CASP7 for the respective targets. For these targets, our de‐novo predictions had an average GDT_S score of 42.81, significantly above the average of all groups. The refinement protocol has difficulty for oligomeric targets and when no near‐native decoys are generated in the decoy library. For targets with high‐quality decoy sets the refinement approach was highly selective. Motivated by this observation, we rescored all server submissions up to 200 amino acids using a similar refinement protocol, but using no clustering, in a QA exercise. We found an excellent correlation between the best server models and those with the lowest energy in the forcefield. The free‐energy refinement protocol may thus be an efficient tool for relative QA and protein structure prediction. Proteins 2009. © 2009 Wiley‐Liss, Inc.     

Partial unfolding and refolding for structure refinement: A unified approach of geometric simulations and molecular dynamics

The most successful protein structure prediction methods to date have been template‐based modeling (TBM) or homology modeling, which predicts protein structure based on experimental structures. These high accuracy predictions sometimes retain structural errors due to incorrect templates or a lack of accurate templates in the case of low sequence similarity, making these structures inadequate in drug‐design studies or molecular dynamics simulations. We have developed a new physics based approach to the protein refinement problem by mimicking the mechanism of chaperons that rehabilitate misfolded proteins. The template structure is unfolded by selectively (targeted) pulling on different portions of the protein using the geometric based technique FRODA, and then refolded using hierarchically restrained replica exchange molecular dynamics simulations (hr‐REMD). FRODA unfolding is used to create a diverse set of topologies for surveying near native‐like structures from a template and to provide a set of persistent contacts to be employed during re‐folding. We have tested our approach on 13 previous CASP targets and observed that this method of folding an ensemble of partially unfolded structures, through the hierarchical addition of contact restraints (that is, first local and then nonlocal interactions), leads to a refolding of the structure along with refinement in most cases (12/13). Although this approach yields refined models through advancement in sampling, the task of blind selection of the best refined models still needs to be solved. Overall, the method can be useful for improved sampling for low resolution models where certain of the portions of the structure are incorrectly modeled. Proteins 2015; 83:2279–2292. © 2015 Wiley Periodicals, Inc.     

Systematic evaluation of CS‐Rosetta for membrane protein structure prediction with sparse NOE restraints

We critically test and validate the CS‐Rosetta methodology for de novo structure prediction of ‐helical membrane proteins (MPs) from NMR data, such as chemical shifts and NOE distance restraints. By systematically reducing the number and types of NOE restraints, we focus on determining the regime in which MP structures can be reliably predicted and pinpoint the boundaries of the approach. Five MPs of known structure were used as test systems, phototaxis sensory rhodopsin II (pSRII), a subdomain of pSRII, disulfide binding protein B (DsbB), microsomal prostaglandin E2 synthase‐1 (mPGES‐1), and translocator protein (TSPO). For pSRII and DsbB, where NMR and X‐ray structures are available, resolution‐adapted structural recombination (RASREC) CS‐Rosetta yields structures that are as close to the X‐ray structure as the published NMR structures if all available NMR data are used to guide structure prediction. For mPGES‐1 and Bacillus cereus TSPO, where only X‐ray crystal structures are available, highly accurate structures are obtained using simulated NMR data. One main advantage of RASREC CS‐Rosetta is its robustness with respect to even a drastic reduction of the number of NOEs. Close‐to‐native structures were obtained with one randomly picked long‐range NOEs for every 14, 31, 38, and 8 residues for full‐length pSRII, the pSRII subdomain, TSPO, and DsbB, respectively, in addition to using chemical shifts. For mPGES‐1, atomically accurate structures could be predicted even from chemical shifts alone. Our results show that atomic level accuracy for helical membrane proteins is achievable with CS‐Rosetta using very sparse NOE restraint sets to guide structure prediction. Proteins 2017; 85:812–826. © 2016 Wiley Periodicals, Inc.     

Antibody side chain conformations are position‐dependent

Side chain prediction is an integral component of computational antibody design and structure prediction. Current antibody modelling tools use backbone‐dependent rotamer libraries with conformations taken from general proteins. Here we present our antibody‐specific rotamer library, where rotamers are binned according to their immunogenetics (IMGT) position, rather than their local backbone geometry. We find that for some amino acid types at certain positions, only a restricted number of side chain conformations are ever observed. Using this information, we are able to reduce the breadth of the rotamer sampling space. Based on our rotamer library, we built a side chain predictor, position‐dependent antibody rotamer swapper (PEARS). On a blind test set of 95 antibody model structures, PEARS had the highest average χ₁ and accuracy (78.7% and 64.8%) compared to three leading backbone‐dependent side chain predictors. Our use of IMGT position, rather than backbone ϕ/ψ, meant that PEARS was more robust to errors in the backbone of the model structure. PEARS also achieved the lowest number of side chain–side chain clashes. PEARS is freely available as a web application at http://opig.stats.ox.ac.uk/webapps/pears .     

3Drefine: Consistent protein structure refinement by optimizing hydrogen bonding network and atomic‐level energy minimization

One of the major limitations of computational protein structure prediction is the deviation of predicted models from their experimentally derived true, native structures. The limitations often hinder the possibility of applying computational protein structure prediction methods in biochemical assignment and drug design that are very sensitive to structural details. Refinement of these low‐resolution predicted models to high‐resolution structures close to the native state, however, has proven to be extremely challenging. Thus, protein structure refinement remains a largely unsolved problem. Critical assessment of techniques for protein structure prediction (CASP) specifically indicated that most predictors participating in the refinement category still did not consistently improve model quality. Here, we propose a two‐step refinement protocol, called 3Drefine, to consistently bring the initial model closer to the native structure. The first step is based on optimization of hydrogen bonding (HB) network and the second step applies atomic‐level energy minimization on the optimized model using a composite physics and knowledge‐based force fields. The approach has been evaluated on the CASP benchmark data and it exhibits consistent improvement over the initial structure in both global and local structural quality measures. 3Drefine method is also computationally inexpensive, consuming only few minutes of CPU time to refine a protein of typical length (300 residues). 3Drefine web server is freely available at http://sysbio.rnet.missouri.edu/3Drefine/ . Proteins 2013. © 2012 Wiley Periodicals, Inc.     

Comparing side chain packing in soluble proteins,protein‐protein interfaces,and transmembrane proteins

We compare side chain prediction and packing of core and non‐core regions of soluble proteins, protein‐protein interfaces, and transmembrane proteins. We first identified or created comparable databases of high‐resolution crystal structures of these 3 protein classes. We show that the solvent‐inaccessible cores of the 3 classes of proteins are equally densely packed. As a result, the side chains of core residues at protein‐protein interfaces and in the membrane‐exposed regions of transmembrane proteins can be predicted by the hard‐sphere plus stereochemical constraint model with the same high prediction accuracies (>90%) as core residues in soluble proteins. We also find that for all 3 classes of proteins, as one moves away from the solvent‐inaccessible core, the packing fraction decreases as the solvent accessibility increases. However, the side chain predictability remains high (80% within ) up to a relative solvent accessibility, , for all 3 protein classes. Our results show that % of the interface regions in protein complexes are “core”, that is, densely packed with side chain conformations that can be accurately predicted using the hard‐sphere model. We propose packing fraction as a metric that can be used to distinguish real protein‐protein interactions from designed, non‐binding, decoys. Our results also show that cores of membrane proteins are the same as cores of soluble proteins. Thus, the computational methods we are developing for the analysis of the effect of hydrophobic core mutations in soluble proteins will be equally applicable to analyses of mutations in membrane proteins.     

Investigating the linkage between disease‐causing amino acid variants and their effect on protein stability and binding

Single amino acid variations (SAV) occurring in human population result in natural differences between individuals or cause diseases. It is well understood that the molecular effect of SAV can be manifested as changes of the wild type characteristics of the corresponding protein, among which are the protein stability and protein interactions. Typically the effect of SAV on protein stability and interactions was assessed via the changes of the wild type folding and binding free energies. However, in terms of SAV affecting protein functionally and disease susceptibility, one wants to know to what extend the wild type function is perturbed by the SAV. Here it is demonstrated that relative, rather than the absolute, change of the folding and binding free energy serves as a good indicator for SAV association with disease. Using HumVar as a source for disease‐causing SAV and experimentally determined free energy changes from ProTherm and SKEMPI databases, correlation coefficients (CC) between the disease index and relative folding and binding probability indexes, respectively, was achieved. The obtained CCs demonstrated the applicability of the proposed approach and it served as good indicator for SAV association with disease. Proteins 2016; 84:232–239. © 2015 Wiley Periodicals, Inc.     

pKa predictions for proteins,RNAs, and DNAs with the Gaussian dielectric function using DelPhi pKa

We developed a Poisson‐Boltzmann based approach to calculate the values of protein ionizable residues (Glu, Asp, His, Lys and Arg), nucleotides of RNA and single stranded DNA. Two novel features were utilized: the dielectric properties of the macromolecules and water phase were modeled via the smooth Gaussian‐based dielectric function in DelPhi and the corresponding electrostatic energies were calculated without defining the molecular surface. We tested the algorithm by calculating values for more than 300 residues from 32 proteins from the PPD dataset and achieved an overall RMSD of 0.77. Particularly, the RMSD of 0.55 was achieved for surface residues, while the RMSD of 1.1 for buried residues. The approach was also found capable of capturing the large shifts of various single point mutations in staphylococcal nuclease (SNase) from ‐cooperative dataset, resulting in an overall RMSD of 1.6 for this set of pKa's. Investigations showed that predictions for most of buried mutant residues of SNase could be improved by using higher dielectric constant values. Furthermore, an option to generate different hydrogen positions also improves predictions for buried carboxyl residues. Finally, the calculations on two RNAs demonstrated the capability of this approach for other types of biomolecules. Proteins 2015; 83:2186–2197. © 2015 Wiley Periodicals, Inc.     

Norovirus RNA‐dependent RNA polymerase: A computational study of metal‐binding preferences

Norovirus (NV) RNA‐dependent RNA polymerase (RdRP) is essential for replicating the genome of the virus, which makes this enzyme a key target for the development of antiviral agents against NV gastroenteritis. In this work, a complex of NV RdRP bound to manganese ions and an RNA primer‐template duplex was investigated using X‐ray crystallography and hybrid quantum chemical/molecular mechanical simulations. Experimentally, the complex crystallized in a tetragonal crystal form. The nature of the primer/template duplex binding in the resulting structure indicates that the complex is a closed back‐tracked state of the enzyme, in which the ‐end of the primer occupies the position expected for the post‐incorporated nucleotide before translocation. Computationally, it is found that the complex can accept a range of divalent metal cations without marked distortions in the active site structure. The highest binding energy is for copper, followed closely by manganese and iron, and then by zinc, nickel, and cobalt. Proteins 2017; 85:1435–1445. © 2017 Wiley Periodicals, Inc.     

Inferring the microscopic surface energy of protein–protein interfaces from mutation data

Mutations at protein–protein recognition sites alter binding strength by altering the chemical nature of the interacting surfaces. We present a simple surface energy model, parameterized with empirical values, yielding mean energies of ?48 cal mol^?1 Å^?2 for interactions between hydrophobic surfaces, ?51 to ?80 cal mol^?1 Å^?2 for surfaces of complementary charge, and 66–83 cal mol^?1 Å^?2 for electrostatically repelling surfaces, relative to the aqueous phase. This places the mean energy of hydrophobic surface burial at ?24 cal mol^?1 Å^?2. Despite neglecting configurational entropy and intramolecular changes, the model correlates with empirical binding free energies of a functionally diverse set of rigid‐body interactions (r = 0.66). When used to rerank docking poses, it can place near‐native solutions in the top 10 for 37% of the complexes evaluated, and 82% in the top 100. The method shows that hydrophobic burial is the driving force for protein association, accounting for 50–95% of the cohesive energy. The model is available open‐source from http://life.bsc.es/pid/web/surface_energy/ and via the CCharpPPI web server http://life.bsc.es/pid/ccharppi/ . Proteins 2015; 83:640–650. © 2015 Wiley Periodicals, Inc.     

Inferring a weighted elastic network from partial unfolding with coarse‐grained simulations

A number of studies have demonstrated that simple elastic network models can reproduce experimental B‐factors, providing insights into the structure–function properties of proteins. Here, we report a study on how to improve an elastic network model and explore its performance by predicting the experimental B‐factors. Elastic network models are built on the experimental coordinates, and they only take the pairs of atoms within a given cutoff distance r_c into account. These models describe the interactions by elastic springs with the same force constant. We have developed a method based on numerical simulations with a simple coarse‐grained force field, to attribute weights to these spring constants. This method considers the time that two atoms remain connected in the network during partial unfolding, establishing a means of measuring the strength of each link. We examined two different coarse‐grained force fields and explored the computation of these weights by unfolding the native structures. Proteins 2014; 82:119–129. © 2013 Wiley Periodicals, Inc.     

Banding 2of NMR‐derived methyl order parameters: Implications for protein dynamics

Our understanding of protein folding, stability, and function has begun to more explicitly incorporate dynamical aspects. Nuclear magnetic resonance has emerged as a powerful experimental method for obtaining comprehensive site‐resolved insight into protein motion. It has been observed that methyl‐group motion tends to cluster into three “classes” when expressed in terms of the popular Lipari‐Szabo model‐free squared generalized order parameter. Here the origins of the three classes or bands in the distribution of order parameters are examined. As a first step, a Bayesian based approach, which makes no a priori assumption about the existence or number of bands, is developed to detect the banding of values derived either from NMR experiments or molecular dynamics simulations. The analysis is applied to seven proteins with extensive molecular dynamics simulations of these proteins in explicit water to examine the relationship between O² and fine details of the motion of methyl bearing side chains. All of the proteins studied display banding, with some subtle differences. We propose a very simple yet plausible physical mechanism for banding. Finally, our Bayesian method is used to analyze the measured distributions of methyl group motions in the catabolite activating protein and several of its mutants in various liganded states and discuss the functional implications of the observed banding to protein dynamics and function. Proteins 2014; 82:2106–2117. © 2014 Wiley Periodicals, Inc.     

i3Drefine Software for Protein 3D Structure Refinement and Its Assessment in CASP10

Protein structure refinement refers to the process of improving the qualities of protein structures during structure modeling processes to bring them closer to their native states. Structure refinement has been drawing increasing attention in the community-wide Critical Assessment of techniques for Protein Structure prediction (CASP) experiments since its addition in 8^th CASP experiment. During the 9^th and recently concluded 10^th CASP experiments, a consistent growth in number of refinement targets and participating groups has been witnessed. Yet, protein structure refinement still remains a largely unsolved problem with majority of participating groups in CASP refinement category failed to consistently improve the quality of structures issued for refinement. In order to alleviate this need, we developed a completely automated and computationally efficient protein 3D structure refinement method, i3Drefine, based on an iterative and highly convergent energy minimization algorithm with a powerful all-atom composite physics and knowledge-based force fields and hydrogen bonding (HB) network optimization technique. In the recent community-wide blind experiment, CASP10, i3Drefine (as ‘MULTICOM-CONSTRUCT’) was ranked as the best method in the server section as per the official assessment of CASP10 experiment. Here we provide the community with free access to i3Drefine software and systematically analyse the performance of i3Drefine in strict blind mode on the refinement targets issued in CASP10 refinement category and compare with other state-of-the-art refinement methods participating in CASP10. Our analysis demonstrates that i3Drefine is only fully-automated server participating in CASP10 exhibiting consistent improvement over the initial structures in both global and local structural quality metrics. Executable version of i3Drefine is freely available at http://protein.rnet.missouri.edu/i3drefine/.     

Bridging between normal mode analysis and elastic network models

Normal mode analysis (NMA) has been a powerful tool for studying protein dynamics. Elastic network models (ENM), through their simplicity, have made normal mode computations accessible to a much broader research community and for many more biomolecular systems. The drawback of ENMs, however, is that they are less accurate than NMA. In this work, through steps of simplification that starts with NMA and ends with ENMs we build a tight connection between NMA and ENMs. In the process of bridging between the two, we have also discovered several high‐quality simplified models. Our best simplified model has a mean correlation with the original NMA that is as high as 0.88. In addition, the model is force‐field independent and does not require energy minimization, and thus can be applied directly to experimental structures. Another benefit of drawing the connection is a clearer understanding why ENMs work well and how it can be further improved. We discovered that can be greatly enhanced by including an additional torsional term and a geometry term. Proteins 2014; 82:2157–2168. © 2014 Wiley Periodicals, Inc.     

Nucleotide‐dependent structural fluctuations and regulation of microtubule‐binding affinity of KIF1A

Molecular motors such as kinesin regulate affinity to a rail protein during the ATP hydrolysis cycle. The regulation mechanism, however, is yet to be determined. To understand this mechanism, we investigated the structural fluctuations of the motor head of the single‐headed kinesin called KIF1A in different nucleotide states using molecular dynamics simulations of a Gō‐like model. We found that the helix at the microtubule (MT) binding site intermittently exhibits a large structural fluctuation when MT is absent. Frequency of this fluctuation changes systematically according to the nucleotide states and correlates strongly with the experimentally observed binding affinity to MT. We also showed that thermal fluctuation enhances the correlation and the interaction with the nucleotide suppresses the fluctuation of the helix . These results suggest that KIF1A regulates affinity to MT by changing the flexibility of the helix during the ATP hydrolysis process: the binding site becomes more flexible in the strong binding state than in the weak binding state. Proteins 2015; 83:809–819. © 2015 Wiley Periodicals, Inc.     

VoroMQA: Assessment of protein structure quality using interatomic contact areas

In the absence of experimentally determined protein structure many biological questions can be addressed using computational structural models. However, the utility of protein structural models depends on their quality. Therefore, the estimation of the quality of predicted structures is an important problem. One of the approaches to this problem is the use of knowledge‐based statistical potentials. Such methods typically rely on the statistics of distances and angles of residue‐residue or atom‐atom interactions collected from experimentally determined structures. Here, we present VoroMQA (Voronoi tessellation‐based Model Quality Assessment), a new method for the estimation of protein structure quality. Our method combines the idea of statistical potentials with the use of interatomic contact areas instead of distances. Contact areas, derived using Voronoi tessellation of protein structure, are used to describe and seamlessly integrate both explicit interactions between protein atoms and implicit interactions of protein atoms with solvent. VoroMQA produces scores at atomic, residue, and global levels, all in the fixed range from 0 to 1. The method was tested on the CASP data and compared to several other single‐model quality assessment methods. VoroMQA showed strong performance in the recognition of the native structure and in the structural model selection tests, thus demonstrating the efficacy of interatomic contact areas in estimating protein structure quality. The software implementation of VoroMQA is freely available as a standalone application and as a web server at http://bioinformatics.lt/software/voromqa . Proteins 2017; 85:1131–1145. © 2017 Wiley Periodicals, Inc.     

Consistent refinement of submitted models at CASP using a knowledge‐based potential

Protein structure refinement is an important but unsolved problem; it must be solved if we are to predict biological function that is very sensitive to structural details. Specifically, critical assessment of techniques for protein structure prediction (CASP) shows that the accuracy of predictions in the comparative modeling category is often worse than that of the template on which the homology model is based. Here we describe a refinement protocol that is able to consistently refine submitted predictions for all categories at CASP7. The protocol uses direct energy minimization of the knowledge‐based potential of mean force that is based on the interaction statistics of 167 atom types (Summa and Levitt, Proc Natl Acad Sci USA 2007; 104:3177–3182). Our protocol is thus computationally very efficient; it only takes a few minutes of CPU time to run typical protein models (300 residues). We observe an average structural improvement of 1% in GDT_TS, for predictions that have low and medium homology to known PDB structures (Global Distance Test score or GDT_TS between 50 and 80%). We also observe a marked improvement in the stereochemistry of the models. The level of improvement varies amongst the various participants at CASP, but we see large improvements (>10% increase in GDT_TS) even for models predicted by the best performing groups at CASP7. In addition, our protocol consistently improved the best predicted models in the refinement category at CASP7 and CASP8. These improvements in structure and stereochemistry prove the usefulness of our computationally inexpensive, powerful and automatic refinement protocol. Proteins 2010. © 2010 Wiley‐Liss, Inc.