Search

Strategies for investigating and optimizing the expression and folding of proteins for biotechnological and pharmaceutical purposes are in high demand. Here, we describe a dual-reporter biosensor system that simultaneously assesses in vivo protein translation and protein folding, thereby enabling rapid screening of mutant libraries. We have validated the dual-reporter system on five different proteins and find an excellent correlation between reporter signals and the levels of protein expression and solubility of the proteins. We further demonstrate the applicability of the dual-reporter system as a screening assay for deep mutational scanning experiments. The system enables high throughput selection of protein variants with high expression levels and altered protein stability. Next generation sequencing analysis of the resulting libraries of protein variants show a good correlation between computationally predicted and experimentally determined protein stabilities. We furthermore show that the mutational experimental data obtained using this system may be useful for protein structure calculations., Heterologous expression of recombinant proteins often results in misfolding, aggregation and degradation. Here, we show an in vivo dual-biosensor system that simultaneously assesses protein translation and protein folding, thereby enabling rapid screening of expression strains as well as mutant libraries.

Structure prediction is an important means to quickly understand new protein functions. However, the prediction of effects of proteins that have no detectable templates is still to be improved. Molecular dynamics simulation is supposed to be the primary research tool for structure predictions, but it still has limitations of huge computational cost in all-atom (AA) models and rough accuracy in coarse-grained (CG) models. We propose a universal multiscale simulation strategy named AIMS in which simulations can iteratively switch among multiple resolutions in order to adaptively trade off AA accuracy and CG high-efficiency. AIMS follows the idea of CG-guided enhanced sampling so that final results always keep AA accuracy. We successfully achieve four ab initio and four data-assisted protein structure predictions using AIMS. The prediction result is an ensemble rather than a structure and provides special insights on folding metastable states. AIMS is estimated to achieve a computational speed about 40 times faster than that of conventional AA simulations.

Background Traditional approaches to elucidation of protein structures by Nuclear Magnetic Resonance spectroscopy (NMR) rely on distance restraints also known as Nuclear Overhauser effects (NOEs). The use of NOEs as the primary source of structure determination by NMR spectroscopy is time consuming and expensive. Residual Dipolar Couplings (RDCs) have become an alternate approach for structure calculation by NMR spectroscopy. In previous works, the software package REDCRAFT has been presented as a means of harnessing the information containing in RDCs for structure calculation of proteins. However, to meet its full potential, several improvements to REDCRAFT must be made. Results In this work, we present improvements to REDCRAFT that include increased usability, better interoperability, and a more robust core algorithm. We have demonstrated the impact of the improved core algorithm in the successful folding of the protein 1A1Z with as high as ±4 Hz of added error. The REDCRAFT computed structure from the highly corrupted data exhibited less than 1.0 Å with respect to the X-ray structure. We have also demonstrated the interoperability of REDCRAFT in a few instances including with PDBMine to reduce the amount of required data in successful folding of proteins to unprecedented levels. Here we have demonstrated the successful folding of the protein 1D3Z (to within 2.4 Å of the X-ray structure) using only N-H RDCs from one alignment medium. Conclusions The additional GUI features of REDCRAFT combined with the NEF compliance have significantly increased the flexibility and usability of this software package. The improvements of the core algorithm have substantially improved the robustness of REDCRAFT in utilizing less experimental data both in quality and quantity.

Proteins exhibit an excellent mechanical function and properties, which are attributed to their folding structure that can sustain a force. The mechanical function and properties are determined by the unfolding of protein structure. Though atomistic simulations are able to provide the unfolding mechanism of proteins at atomic scale, they are computationally restrictive for understanding the unfolding of large protein structures. Here, we consider an elastic network model (ENM), which is a coarse-grained model for protein structure, to study the unfolding pathway of proteins. It is shown that ENM is able to predict the anisotropic unfolding behavior of protein and its unfolding pathway. In addition, we show that the unfolding pathway of a protein due to thermal denaturation is comparable to the unfolding pathway driven by a mechanical force. Our study sheds light on the ENM for quantitative understanding of the unfolding mechanisms of proteins with computational efficiency.

Introduction. The spatial protein structure folding is an important and actual problem in computational biology. Considering the mathematical model of the task, it can be easily concluded that finding an optimal protein conformation in a three dimensional grid is a NP-hard problem. Therefore some reinforcement learning techniques such as Q-learning approach can be used to solve the problem. The article proposes a new geometric “state-action” space representation which significantly differs from all alternative representations used for this problem. The purpose of the article is to analyze existing approaches of different states and actions spaces representations for Q-learning algorithm for protein structure folding problem, reveal their advantages and disadvantages and propose the new geometric “state-space” representation. Afterwards the goal is to compare existing and the proposed approaches, make conclusions with also describing possible future steps of further research. Result. The work of the proposed algorithm is compared with others on the basis of 10 known chains with a length of 48 first proposed in [16]. For each of the chains the Q-learning algorithm with the proposed “state-space” representation outperformed the same Q-learning algorithm with alternative existing “state-space” representations both in terms of average and minimal energy values of resulted conformations. Moreover, a plenty of existing representations are used for a 2D protein structure predictions. However, during the experiments both existing and proposed representations were slightly changed or developed to solve the problem in 3D, which is more computationally demanding task. Conclusion. The quality of the Q-learning algorithm with the proposed geometric “state-action” space representation has been experimentally confirmed. Consequently, it’s proved that the further research is promising. Moreover, several steps of possible future research such as combining the proposed approach with deep learning techniques has been already suggested. Keywords: Spatial protein structure, combinatorial optimization, relative coding, machine learning, Q-learning, Bellman equation, state space, action space, basis in 3D space.

Introduction. The spatial protein structure folding is an important and actual problem in biology. Considering the mathematical model of the task, we can conclude that it comes down to the combinatorial optimization problem. Therefore, genetic and mimetic algorithms can be used to find a solution. The article proposes a genetic algorithm with a new greedy stochastic crossover operator, which differs from classical approaches with paying attention to qualities of possible ancestors. The purpose of the article is to describe a genetic algorithm with a new greedy stochastic crossover operator, reveal its advantages and disadvantages, compare the proposed algorithm with the best-known implementations of genetic and memetic algorithms for the spatial protein structure prediction, and make conclusions with future steps suggestion afterward. Result. The work of the proposed algorithm is compared with others on the basis of 10 known chains with a length of 48 first proposed in [13]. For each of the chain, a global minimum of free energy was already precalculated. The algorithm found 9 out of 10 spatial structures on which a global minimum of free energy is achieved and also demonstrated a better average value of solutions than the comparing algorithms. Conclusion. The quality of the genetic algorithm with the greedy stochastic crossover operator has been experimentally confirmed. Consequently, its further research is promising. For example, research on the selection of optimal algorithm parameters, improving the speed and quality of solutions found through alternative coding or parallelization. Also, it is worth testing the proposed algorithm on datasets with proteins of other lengths for further checks of the algorithm’s validity. Keywords: spatial protein structure, combinatorial optimization, genetic algorithms, crossover operator, stochasticity.

Noncoding RNAs are increasingly found to play a wide variety of roles in living organisms. Yet, their functional mechanisms are poorly understood because their structures are difficult to determine experimentally. As a result, developing more effective computational techniques to predict RNA structures becomes increasingly an urgent task. One key challenge in RNA structure prediction is the lack of an accurate free energy function to guide RNA folding and discriminate native and near-native structures from decoy conformations. In this study, we developed an all-atom distance-dependent knowledge-based energy function for RNA that is based on a reference state (distance-scaled finite ideal-gas reference state, DFIRE) proven successful for protein structure discrimination. Using four separate benchmarks including RNA puzzles, we found that this DFIRE-based RNA statistical energy function is able to discriminate native and near-native structures against decoys with performance comparable with or better than several existing scoring functions compared. The energy function is expected to be useful for improving the detection of RNA near-native structures.

Datasets representing the conformational landscapes of protein structures are high dimensional and hence present computational challenges. Efficient and effective dimensionality reduction of these datasets is therefore paramount to our ability to analyze the conformational landscapes of proteins and extract important information regarding protein folding, conformational changes and binding. Representing the structures with fewer attributes that capture the most variance of the data, makes for quicker and precise analysis of these structures. In this work we make use of dimensionality reduction methods for reducing the number of instances and for feature reduction. The reduced dataset that is obtained is then subjected to topological and quantitative analysis. In this step we perform hierarchical clustering to obtain different sets of conformation clusters that may correspond to intermediate structures. The structures represented by these conformations are then analyzed by studying their high dimension topological properties to identify truly distinct conformations and holes in the conformational space that may represent high energy barriers. Our results show that the clusters closely follow known experimental results about intermediate structures, as well as binding and folding events.

The total number of amino acid sequences that can fold to a target protein structure, known as “designability”, is a fundamental property of proteins that contributes to their structure and function robustness. The highly designable structures always have higher thermodynamic stability, mutational stability, fast folding, regular secondary structures, and tertiary symmetries. Although it has been studied on lattice models for very short chains by exhaustive enumeration, it remains a challenge to estimate the designable quantitatively for real proteins. In this study, we designed a new deep neural network model that samples protein sequences given a backbone structure using sequential Monte Carlo method. The sampled sequences with proper weights were used to estimate the designability of several real proteins. The designed sequences were also tested using the latest AlphaFold2 and RoseTTAFold to confirm their foldabilities. We report this as the first study to estimate the designability of real proteins.

Cryo-electron microscopy (EM) requires molecular modeling to refine structural details from data. Ensemble models arrive at low free-energy molecular structures, but are computationally expensive and limited to resolving only small proteins that cannot be resolved by cryo-EM. Here, we introduce CryoFold - a pipeline of molecular dynamics simulations that determines ensembles of protein structures directly from sequence by integrating density data of varying sparsity at 3-5 Å resolution with coarse-grained topological knowledge of the protein folds. We present six examples showing its broad applicability for folding proteins between 72 to 2000 residues, including large membrane and multi-domain systems, and results from two EMDB competitions. Driven by data from a single state, CryoFold discovers ensembles of common low-energy models together with rare low-probability structures that capture the equilibrium distribution of proteins constrained by the density maps. Many of these conformations, unseen by traditional methods, are experimentally validated and functionally relevant. We arrive at a set of best practices for data-guided protein folding that are controlled using a Python GUI.

Protein structure prediction has long been considered a gateway problem for understanding protein folding. Recent advances in deep learning have achieved unprecedented success at predicting a protein’s crystal structure, but whether this achievement relates to a better modelling of the folding process remains an open question. In this work, we compare the pathways generated by state-of-the-art protein structure prediction methods to experimental folding data. The methods considered were AlphaFold 2, RoseTTAFold, trRosetta, RaptorX, DMPfold, EVfold, SAINT2 and Rosetta. We find evidence that their simulated dynamics capture some information about the folding pathwhay, but their predictive ability is worse than a trivial classifier using sequence-agnostic features like chain length. The folding trajectories produced are also uncorrelated with parameters such as intermediate structures and the folding rate constant. These results suggest that recent advances in protein structure prediction do not yet provide an enhanced understanding of the principles underpinning protein folding.

The prediction of protein structure and the design of novel protein sequences and structures have long been intertwined. The recently released AlphaFold has heralded a new generation of accurate protein structure prediction, but the extent to which this affects protein design stands yet unexplored. Here we develop a rapid and effective approach for fixed backbone computational protein design, leveraging the predictive power of AlphaFold. For several designs we demonstrate that not only are the AlphaFold predicted structures in agreement with the desired backbones, but they are also supported by the structure predictions of other supervised methods as well asab initiofolding. These results suggest that AlphaFold, and methods like it, are able to facilitate the development of a new range of novel and accurate protein design methodologies.

AlphaFold2 and related systems use deep learning to predict protein structure from co-evolutionary relationships encoded in multiple sequence alignments (MSAs). Despite dramatic, recent increases in accuracy, three challenges remain: (i) prediction of orphan and rapidly evolving proteins for which an MSA cannot be generated, (ii) rapid exploration of designed structures, and (iii) understanding the rules governing spontaneous polypeptide folding in solution. Here we report development of an end-to-end differentiable recurrent geometric network (RGN) able to predict protein structure from single protein sequences without use of MSAs. This deep learning system has two novel elements: a protein language model (AminoBERT) that uses a Transformer to learn latent structural information from millions of unaligned proteins and a geometric module that compactly represents Cα backbone geometry. RGN2 outperforms AlphaFold2 and RoseTTAFold (as well as trRosetta) on orphan proteins and is competitive with designed sequences, while achieving up to a 106-fold reduction in compute time. These findings demonstrate the practical and theoretical strengths of protein language models relative to MSAs in structure prediction.

Sequence-based contact prediction has shown considerable promise in assisting non-homologous structure modeling, but it often requires many homologous sequences and a sufficient number of correct contacts to achieve correct folds. Here, we developed a method, C-QUARK, that integrates multiple deep-learning and coevolution-based contact-maps to guide the replica-exchange Monte Carlo fragment assembly simulations. The method was tested on 247 non-redundant proteins, where C-QUARK could fold 75% of the cases with TM-scores (template-modeling scores) ≥0.5, which was 2.6 times more than that achieved by QUARK. For the 59 cases that had either low contact accuracy or few homologous sequences, C-QUARK correctly folded 6 times more proteins than other contact-based folding methods. C-QUARK was also tested on 64 free-modeling targets from the 13th CASP (critical assessment of protein structure prediction) experiment and had an average GDT_TS (global distance test) score that was 5% higher than the best CASP predictors. These data demonstrate, in a robust manner, the progress in modeling non-homologous protein structures using low-accuracy and sparse contact-map predictions., Predicting protein structure from sequence is still not possible for all proteins. Here, the authors introduce a method that integrates deep learning and information about protein co-evolution to guide the prediction of non-homologous protein structures with greater accuracy.

Meta contact, which combines different contact maps into one to improve contact prediction accuracy and effectively reduce the noise from a single contact map, is a widely used method. However, protein structure prediction using meta contact cannot fully exploit the information carried by original contact maps. In this work, a multi contact-based folding method under the evolutionary algorithm framework, MultiCFold, is proposed. In MultiCFold, the thorough information of different contact maps is directly used by populations to guide protein structure folding. In addition, noncontact is considered as an effective supplement to contact information and can further assist protein folding. MultiCFold is tested on a set of 120 nonredundant proteins, and the average TM-score and average RMSD reach 0.617 and 5.815 Å, respectively. Compared with the meta contact-based method, MetaCFold, average TM-score and average RMSD have a 6.62 and 8.82% improvement. In particular, the import of noncontact information increases the average TM-score by 6.30%. Furthermore, MultiCFold is compared with four state-of-the-art methods of CASP13 on the 24 FM targets, and results show that MultiCFold is significantly better than other methods after the full-atom relax procedure.

Proteins are translated from the N- to the C-terminus, raising the basic question of how this innate directionality affects their evolution. To explore this question, we analyze 16,200 structures from the protein data bank (PDB). We find remarkable enrichment of α-helices at the C terminus and β-strands at the N terminus. Furthermore, this α-β asymmetry correlates with sequence length and contact order, both determinants of folding rate, hinting at possible links to co-translational folding (CTF). Hence, we propose the 'slowest-first' scheme, whereby protein sequences evolved structural asymmetry to accelerate CTF: the slowest of the cooperatively-folding segments are positioned near the N terminus so they have more time to fold during translation. A phenomenological model predicts that CTF can be accelerated by asymmetry in folding rate, up to double the rate, when folding time is commensurate with translation time; analysis of the PDB predicts that structural asymmetry is indeed maximal in this regime. This correspondence is greater in prokaryotes, which generally require faster protein production. Altogether, this indicates that accelerating CTF is a substantial evolutionary force whose interplay with stability and functionality is encoded in secondary structure asymmetry. SIGNIFICANCE Proteins are inherently asymmetric, as they are translated sequentially from the N- to the C-terminal. To see how this affects protein evolution we analyse protein structures, finding corresponding asymmetries in secondary structure: α-helices are enriched at the C-terminal and β-sheets at the N-terminal. To explain this significant asymmetry, we propose the 'slowest-first' scheme: slow-folding structures are located at the N-terminal so they are translated first and thus have more time to fold during translation. The asymmetry peaks when folding time and translation time are similar, where our model predicts that proteins can benefit most from α-β asymmetry. Altogether, this work provides evidence for the evolution of structural asymmetry in proteins to accelerate co-translational folding, and proposes further experimental tests.

Computational protein design has taken big strides over the recent years, however, the tools available are still not at a state where a sequence can be designed to fold into a given protein structure at will and with high probability. We have here applied a recent release of Rosetta Design to redesign a set of structurally very similar proteins belonging to the Thioredoxin fold. We determined design success using a combination of a genetic screening tool to assay folding/stability in E. coli and selecting the best hits from this for further biochemical characterization. We have previously used this set of template proteins for redesign and found that success was highly dependent on template structure, a trait which was also found in this study. Nevertheless, state of the art design software is now able to predict the best template, most likely due to the introduction of the cart_bonded energy term. The template that led to the greatest fraction of successful designs was the same (a Thioredoxin from spinach) as that identified in our previous study. Our previously described redesign of Thioredoxin, which also used the spinach protein as template, however also performed well. In the present study, both these templates yielded proteins with compact folded structures, and enforces the conclusion that any design project must carefully consider different design templates. Fortunately, selecting designs using the cart_bonded energy term appears to correctly identify such templates.

MotivationContact predictions within a protein has recently become a viable method for accurate prediction of protein structure. Using predicted distance distributions has been shown in many cases to be superior to only using a binary contact annotation. Using predicted inter-protein distances has also been shown to be able to dock some protein dimers.ResultsHere we present pyconsFold. Using CNS as its underlying folding mechanism and predicted contact distance it outperforms regular contact prediction based modelling on our dataset of 210 proteins. It performs marginally worse than the state of the art pyRosetta folding pipeline but is on average about 20 times faster per model. More importantly pyconsFold can also be used as a fold-and-dock protocol by using predicted inter-protein contacts to simultaneously fold and dock two protein chains.Availability and implementationpyconsFold is implemented in Python 3 with a strong focus on using as few dependencies as possible for longevity. It is available both as a pip package in Python 3 and as source code on GitHub and is published under the GPLv3 license.Contactarne@bioinfo.seSupplemental materialInstall instructions, examples and parameters can be found in the supplemental notes.Availability of dataThe data underlying this article together with source code are available on github, at https://github.com/johnlamb/pyconsfold.

Motivation The mathematically optimal solution in computational protein folding simulations does not always correspond to the native structure, due to the imperfection of the energy force fields. There is therefore a need to search for more diverse suboptimal solutions in order to identify the states close to the native. We propose a novel multimodal optimization protocol to improve the conformation sampling efficiency and modeling accuracy of de novo protein structure folding simulations. Results A distance-assisted multimodal optimization sampling algorithm, MMpred, is proposed for de novo protein structure prediction. The protocol consists of three stages: The first is a modal exploration stage, in which a structural similarity evaluation model DMscore is designed to control the diversity of conformations, generating a population of diverse structures in different low-energy basins. The second is a modal maintaining stage, where an adaptive clustering algorithm MNDcluster is proposed to divide the populations and merge the modal by adjusting the annealing temperature to locate the promising basins. In the last stage of modal exploitation, a greedy search strategy is used to accelerate the convergence of the modal. Distance constraint information is used to construct the conformation scoring model to guide sampling. MMpred is tested on a large set of 320 non-redundant proteins, where MMpred obtains models with TM-score≥0.5 on 291 cases, which is 28% higher than that of Rosetta guided with the same set of distance constraints. In addition, on 320 benchmark proteins, the enhanced version of MMpred (E-MMpred) has 167 targets better than trRosetta when the best of five models are evaluated. The average TM-score of the best model of E-MMpred is 0.732, which is comparable to trRosetta (0.730). Availability and implementation The source code and executable are freely available at https://github.com/iobio-zjut/MMpred. Supplementary information Supplementary data are available at Bioinformatics online.

Natural proteins are characterised by a complex folding pathway defined uniquely for each fold. Designed coiled-coil protein origami (CCPO) cages are distinct from natural compact proteins, since their fold is prescribed by discrete long-range interactions between orthogonal pairwise-interacting coiled-coil (CC) modules within a single polypeptide chain. Here, we demonstrate that CCPO proteins fold in a stepwise sequential pathway. Molecular dynamics simulations and stopped-flow Förster resonance energy transfer (FRET) measurements reveal that CCPO folding is dominated by the effective intra-chain distance between CC modules in the primary sequence and subsequent folding intermediates, allowing identical CC modules to be employed for multiple cage edges and thus relaxing CCPO cage design requirements. The number of orthogonal modules required for constructing a CCPO tetrahedron can be reduced from six to as little as three different CC modules. The stepwise modular nature of the folding pathway offers insights into the folding of tandem repeat proteins and can be exploited for the design of modular protein structures based on a given set of orthogonal modules., Coiled-coil protein origami (CCPO) is a strategy for the design of polyhedral cage-shaped protein folds based on coiled-coil (CC) dimer-forming peptides. Here, the authors show that CCPO proteins fold in a multistep process governed by the spatial distance between CC modules in the primary sequence and subsequent folding intermediates, which enables the use of identical CC modules for the CCPO tetrahedron design.

The topology of protein folds can be specified by the inter-residue contact-maps and accurate contact-map prediction can helpab initiostructure folding. We developed TripletRes to deduce protein contact-maps from discretized distance profiles by end-to-end training of deep residual neural-networks. Compared to previous approaches, the major advantage of TripletRes is in its ability to learn and directly fuse a triplet of coevolutionary matrices extracted from the whole-genome and metagenome databases and therefore minimize the information loss during the course of contact model training. TripletRes was tested on a large set of 245 non-homologous proteins from CASP and CAMEO experiments, and outperformed other state-of-the-art methods by at least 58.4% for the CASP 11&12 and 44.4% for the CAMEO targets in the top-Llong-range contact precision. On the 31 FM targets from the latest CASP13 challenge, TripletRes achieved the highest precision (71.6%) for the top-L/5 long-range contact predictions. These results demonstrate a novel efficient approach to extend the power of deep convolutional networks for high-accuracy medium- and long-range protein contact-map predictions starting from primary sequences, which are critical for constructing 3D structure of proteins that lack homologous templates in the PDB library.AvailabilityThe training and testing data, standalone package, and the online server for TripletRes are available athttps://zhanglab.ccmb.med.umich.edu/TripletRes/.Author SummaryAb initioprotein folding has been a major unsolved problem in computational biology for more than half a century. Recent community-wide Critical Assessment of Structure Prediction (CASP) experiments have witnessed exciting progress onab initiostructure prediction, which was mainly powered by the boosting of contact-map prediction as the latter can be used as constraints to guideab initiofolding simulations. In this work, we proposed a new open-source deep-learning architecture, TripletRes, built on the residual convolutional neural networks for high-accuracy contact prediction. The large-scale benchmark and blind test results demonstrate significant advancement of the proposed methods over other approaches in predicting medium- and long-range contact-maps that are critical for guiding protein folding simulations. Detailed data analyses showed that the major advantage of TripletRes lies in the unique protocol to fuse multiple evolutionary feature matrices which are directly extracted from whole-genome and metagenome databases and therefore minimize the information loss during the contact model training.

The topology of protein folds can be specified by the inter-residue contact-maps and accurate contact-map prediction can help ab initio structure folding. We developed TripletRes to deduce protein contact-maps from discretized distance profiles by end-to-end training of deep residual neural-networks. Compared to previous approaches, the major advantage of TripletRes is in its ability to learn and directly fuse a triplet of coevolutionary matrices extracted from the whole-genome and metagenome databases and therefore minimize the information loss during the course of contact model training. TripletRes was tested on a large set of 245 non-homologous proteins from CASP 11&12 and CAMEO experiments and outperformed other top methods from CASP12 by at least 58.4% for the CASP 11&12 targets and 44.4% for the CAMEO targets in the top-L long-range contact precision. On the 31 FM targets from the latest CASP13 challenge, TripletRes achieved the highest precision (71.6%) for the top-L/5 long-range contact predictions. It was also shown that a simple re-training of the TripletRes model with more proteins can lead to further improvement with precisions comparable to state-of-the-art methods developed after CASP13. These results demonstrate a novel efficient approach to extend the power of deep convolutional networks for high-accuracy medium- and long-range protein contact-map predictions starting from primary sequences, which are critical for constructing 3D structure of proteins that lack homologous templates in the PDB library., Author summary Ab initio protein folding has been a major unsolved problem in computational biology for more than half a century. Recent community-wide Critical Assessment of Structure Prediction (CASP) experiments have witnessed exciting progress on ab initio structure prediction, which was mainly powered by the boosting of contact-map prediction as the latter can be used as constraints to guide ab initio folding simulations. In this work, we proposed a new open-source deep-learning architecture, TripletRes, built on the residual convolutional neural networks for high-accuracy contact prediction. The large-scale benchmark and blind test results demonstrate competitive performance of the proposed methods to other top approaches in predicting medium- and long-range contact-maps that are critical for guiding protein folding simulations. Detailed data analyses showed that the major advantage of TripletRes lies in the unique protocol to fuse multiple evolutionary feature matrices which are directly extracted from whole-genome and metagenome databases and therefore minimize the information loss during the contact model training.

Atomistic simulations can provide valuable, experimentally-verifiable insights into protein folding mechanisms, but existing ab initio simulation methods are restricted to only the smallest proteins due to severe computational speed limits. The folding of larger proteins has been studied using native-centric potential functions, but such models omit the potentially crucial role of non-native interactions. Here, we present an algorithm, entitled DBFOLD, which can predict folding pathways for a wide range of proteins while accounting for the effects of non-native contacts. In addition, DBFOLD can predict the relative rates of different transitions within a protein’s folding pathway. To accomplish this, rather than directly simulating folding, our method combines equilibrium Monte-Carlo simulations, which deploy enhanced sampling, with unfolding simulations at high temperatures. We show that under certain conditions, trajectories from these two types of simulations can be jointly analyzed to compute unknown folding rates from detailed balance. This requires inferring free energies from the equilibrium simulations, and extrapolating transition rates from the unfolding simulations to lower, physiologically-reasonable temperatures at which the native state is marginally stable. As a proof of principle, we show that our method can accurately predict folding pathways and Monte-Carlo rates for the well-characterized Streptococcal protein G. We then show that our method significantly reduces the amount of computation time required to compute the folding pathways of large, misfolding-prone proteins that lie beyond the reach of existing direct simulation. Our algorithm, which is available online, can generate detailed atomistic models of protein folding mechanisms while shedding light on the role of non-native intermediates which may crucially affect organismal fitness and are frequently implicated in disease., Author summary Many proteins must adopt a specific structure in order to function. Computational simulations have been used to shed light on the mechanisms of protein folding, but unfortunately, realistic simulations can typically only be run for small proteins, due to severe limits in computational speed. Here, we present a method to solve this problem, whereby instead of directly simulating folding from an unfolded state, we run simulations that allow for computation of equilibrium folding free energies, alongside high temperature simulations to compute unfolding rates. From these quantities, folding rates can be computed using detailed balance. Importantly, our method can account for the effects of nonnative contacts which transiently form during folding and must be broken prior to adoption of the native state. Such contacts, which are often excluded from simple models of folding, may crucially affect real protein folding pathways and are often observed in folding intermediates implicated in disease.

Traditional molecular dynamics (MD) simulations have difficulties in tracking the slow molecular motions, at least partially due to the waste of sampling in already sampled regions. Here, we proposed a new enhanced sampling method, frontier expansion sampling (FEXS), to improve the sampling efficiency of molecular simulations by iteratively selecting seed structures diversely distributed at the "frontier" of an already sampled region to initiate new simulations. Different from other enhanced sampling methods, FEXS identifies the "frontier" seeds by integrating the Gaussian mixture model and the convex hull algorithm, which effectively improves the structural variation among the selected seeds and thus the descendant simulations. Validation in three protein systems, including the folding of chignolin, open-to-closed transition of maltodextrin binding protein, and internal conformational change of bovine pancreatic trypsin inhibitor, confirmed the effectiveness of this novel method in enhancing the sampling of conventional MD simulations to observe the large-scale protein conformational changes. When compared with other enhanced sampling methods like the structural dissimilarity sampling (SDS), FEXS reached at least the same level of sampling efficiency but was capable of providing complementary information in the three tested protein systems.

Motivation From evolutionary interference, function annotation to structural prediction, protein sequence comparison has provided crucial biological insights. While many sequence alignment algorithms have been developed, existing approaches often cannot detect hidden structural relationships in the ‘twilight zone’ of low sequence identity. To address this critical problem, we introduce a computational algorithm that performs protein Sequence Alignments from deep-Learning of Structural Alignments (SAdLSA, silent ‘d’). The key idea is to implicitly learn the protein folding code from many thousands of structural alignments using experimentally determined protein structures. Results To demonstrate that the folding code was learned, we first show that SAdLSA trained on pure α-helical proteins successfully recognizes pairs of structurally related pure β-sheet protein domains. Subsequent training and benchmarking on larger, highly challenging datasets show significant improvement over established approaches. For challenging cases, SAdLSA is ∼150% better than HHsearch for generating pairwise alignments and ∼50% better for identifying the proteins with the best alignments in a sequence library. The time complexity of SAdLSA is O(N) thanks to GPU acceleration. Availability and implementation Datasets and source codes of SAdLSA are available free of charge for academic users at http://sites.gatech.edu/cssb/sadlsa/. Supplementary information Supplementary data are available at Bioinformatics online.

Theory, computation and experiment have matched up for the folding of small proteins in vitro, a difficult feat because folding energy landscapes are fairly smooth and free energy differences between states are small. Smoothness means that protein structure and folding are susceptible to the local environment inside living cells. Theory, computation and experiment are now exploring cellular modulation of energy landscapes. Interesting concepts have emerged, such as co-evolution of protein surfaces with their cellular environment to reduce detrimental interactions. Here we look at very recent work beginning to bring together theory, simulations and experiments in the area of protein landscape modulation, to see what problems might be solved in the near future by combining these approaches.

Protein structure resolution has lagged far behind sequence determination, as it is often laborious and time-consuming to resolve individual protein structure – more often than not even impossible. For computational prediction, due to the lack of detailed knowledge on the folding driving forces, how to design an energy function is still an open question. Furthermore, an effective criterion to evaluate the performance of the energy function is also lacking. Here we present a novel knowledge-based-energy scoring function, simply considering the interactions of peptide bonds, rather than, as conventionally, the residues or atoms as the most important energy contribution. This energy scoring was evaluated by selecting the X-ray structure from a large number of possibilities. It not only outperforms the best of the previously published statistical potentials, but also has very low computational expense. Besides, we suggest an alternative criterion to evaluate the performance of the energy scoring function, measured by the template modeling score of the selected rank-one. We argue that the comparison should allow for some deviation between the x-ray and predicted structures. Collectively, this accurate and simple energy scoring function, together with the optimized criterion, will significantly advance the computational protein structure prediction.

Many aspects of the study of protein folding and dynamics have been affected by the recent advances in machine learning. Methods for the prediction of protein structures from their sequences are now heavily based on machine learning tools. The way simulations are performed to explore the energy landscape of protein systems is also changing as force-fields are started to be designed by means of machine learning methods. These methods are also used to extract the essential information from large simulation datasets and to enhance the sampling of rare events such as folding/unfolding transitions. While significant challenges still need to be tackled, we expect these methods to play an important role on the study of protein folding and dynamics in the near future. We discuss here the recent advances on all these fronts and the questions that need to be addressed for machine learning approaches to become mainstream in protein simulation.

The design of protein conformational switches—or proteins that change conformations in response to a signal such as ligand binding—has great potential for developing novel biosensors, diagnostic tools, and therapeutic agents. Among the defining properties of such switches, the response time has been the most challenging to optimize. Here we apply a computational design strategy in synergistic combination with biophysical experiments to rationally improve the response time of an engineered protein-based Ca2+-sensor in which the switching process occurs via mutually exclusive folding of two alternate frames. Notably, our strategy identifies mutations that increase switching rates by as much as 32-fold, achieving response times on the order of fast physiological Ca2+ fluctuations. Our computational design strategy is general and may aid in optimizing the kinetics of other protein conformational switches., The rational optimization of response times of protein conformational switches is a major challenge for biomolecular switch design. Here the authors present a generally applicable computational design strategy that in combination with biophysical experiments can improve response times using a Ca2+-sensor as an example.

Contacts play a fundamental role in the study of protein structure and folding problems. The contact map of a protein can be represented by arranging its amino acids on a horizontal line and drawing an arc between two residues if they form a contact. In this paper, we are mainly concerned with the combinatorial enumeration of the arcs in m-regular linear stack, an elementary structure of the protein contact map, which was introduced by Chen et al. (J Comput Biol 21(12):915-935, 2014). We modify the generating function for m-regular linear stacks by introducing a new variable y regarding to the number of arcs and obtain an equation satisfied by the generating function for m-regular linear stacks with n vertices and k arcs. Consequently, we also derive an equation satisfied by the generating function of the overall number of arcs in m-regular linear stacks with n vertices.

Background Residue-residue contacts are key features for accurate de novo protein structure prediction. For the optimal utilization of these predicted contacts in folding proteins accurately, it is important to study the challenges of reconstructing protein structures using true contacts. Because contact-guided protein modeling approach is valuable for predicting the folds of proteins that do not have structural templates, it is necessary for reconstruction studies to focus on hard-to-predict protein structures. Results Using a data set consisting of 496 structural domains released in recent CASP experiments and a dataset of 150 representative protein structures, in this work, we discuss three techniques to improve the reconstruction accuracy using true contacts – adding secondary structures, increasing contact distance thresholds, and adding non-contacts. We find that reconstruction using secondary structures and contacts can deliver accuracy higher than using full contact maps. Similarly, we demonstrate that non-contacts can improve reconstruction accuracy not only when the used non-contacts are true but also when they are predicted. On the dataset consisting of 150 proteins, we find that by simply using low ranked predicted contacts as non-contacts and adding them as additional restraints, can increase the reconstruction accuracy by 5% when the reconstructed models are evaluated using TM-score. Conclusions Our findings suggest that secondary structures are invaluable companions of contacts for accurate reconstruction. Confirming some earlier findings, we also find that larger distance thresholds are useful for folding many protein structures which cannot be folded using the standard definition of contacts. Our findings also suggest that for more accurate reconstruction using predicted contacts it is useful to predict contacts at higher distance thresholds (beyond 8 Å) and predict non-contacts. Electronic supplementary material The online version of this article (10.1186/s12859-017-1807-5) contains supplementary material, which is available to authorized users.

Exploring structure space to understand stability Understanding the determinants of protein stability is challenging because native proteins have conformations that are optimized for function. Proteins designed without functional bias could give insight into how structure determines stability, but this requires a large sample size. Rocklin et al. report a high-throughput protein design and characterization method that allows them to measure thousands of miniproteins (see the Perspective by Woolfson et al. ). Iterative rounds of design and characterization increased the design success rate from 6 to 47%, which provides insight into the balance of forces that determine protein stability. Science , this issue p. 168 ; see also p. 133

Predicting the unfolding rates of proteins remains complicated due to the intricacy present in the unfolding pathway of proteins and further it was observed that the experimental unfolding data were less while compared to folding kinetics. The aim of our present work is to show the variation in long-range contacts observed in various sequence separation bins belonging to all-α, all-β and mixed structural classes of 52 two-state proteins. In this work linear regression technique have been used and regression equations were developed using long-range contacts observed from various sequence separation bins. Also nine topological parameters developed from the 3-D structures of proteins are related with their experimental unfolding rates and their variation in correlation coefficient is observed before and after structural classification. The present work aims to show that long-range contacts formed between residues which are sequentially far and spatially close in the 3-D structure of proteins play a crucial role in the unfolding mechanism of proteins. Also importance of long-range contacts in various experimental and theoretical studies of protein folding along with NMR studies of the unfolded non-native states of proteins have been discussed.

The complex and rugged potential energy landscape has made protein structure prediction a challenging task in computational biology. Here, we propose an efficient protein structure prediction method combining both template-based and template-free methods. Specifically, the initial protein conformations can be built by a non-redundant protein database and random sampling method with constraints of the secondary structure of the proteins. Three different structure evolution methods including improved particle swarm optimization (PSO) algorithm, random perturbation and fragment substitution are employed to update the protein structures while keeping the secondary structures the same. The present method is benchmarked on several known protein structures with distinct folding patterns, including α proteins, β proteins and αβ proteins. The high success rate and the accuracy of the results demonstrate the reliability of this method.

Motivation PredMP is the first web service, to our knowledge, that aims at de novo prediction of the membrane protein (MP) 3D structure followed by the embedding of the MP into the lipid bilayer for visualization. Our approach is based on a high-throughput Deep Transfer Learning (DTL) method that first predicts MP contacts by learning from non-MPs and then predicts the 3D model of the MP using the predicted contacts as distance restraints. This algorithm is derived from our previous Deep Learning (DL) method originally developed for soluble protein contact prediction, which has been officially ranked No. 1 in CASP12. The DTL framework in our approach overcomes the challenge that there are only a limited number of solved MP structures for training the deep learning model. There are three modules in the PredMP server: (i) The DTL framework followed by the contact-assisted folding protocol has already been implemented in RaptorX-Contact, which serves as the key module for 3D model generation; (ii) The 1D annotation module, implemented in RaptorX-Property, is used to predict the secondary structure and disordered regions; and (iii) the visualization module to display the predicted MPs embedded in the lipid bilayer guided by the predicted transmembrane topology. Results Tested on 510 non-redundant MPs, our server predicts correct folds for ∼290 MPs, which significantly outperforms existing methods. Tested on a blind and live benchmark CAMEO from September 2016 to January 2018, PredMP can successfully model all 10 MPs belonging to the hard category. Availability and implementation PredMP is freely accessed on the web at http://www.predmp.com. Supplementary information Supplementary data are available at Bioinformatics online.

In spite of the fact that there has been a significant increase in the number of solved protein structures, structural information is missing for many proteins. Although structural information is codified in the amino acid sequence, computational prediction using only this information is still an unsolved problem. However, one successful method to model a protein's structure starting from the primary sequence is to use contact prediction derived from multiple sequence alignment (MSA). Here we use our contact predictor PconsC4 to generate a list of probable contacts between residues in the primary sequences. These contacts are then used together with the secondary structure prediction as constraints for the CONFOLD folding method. In this way, a 3D protein model can be built starting directly from the primary sequence. © 2019 by John Wiley & Sons, Inc.

Protein folding and structure prediction are two sides of the same coin. Contact maps and the related techniques of constraint-based structure reconstruction can be considered as unifying aspects of both processes. We present the Structural Relevance (SR) score which quantifies the information content of individual contacts and residues in the context of the whole native structure. The physical process of protein folding is commonly characterized with spatial and temporal resolution: some residues are Early Folding while others are Highly Stable with respect to unfolding events. We employ the proposed SR score to demonstrate that folding initiation and structure stabilization are subprocesses realized by distinct sets of residues. The example of cytochrome c is used to demonstrate how StructureDistiller identifies the most important contacts needed for correct protein folding. This shows that entries of a contact map are not equally relevant for structural integrity. The proposed StructureDistiller algorithm identifies contacts with the highest information content; these entries convey unique constraints not captured by other contacts. Identification of the most informative contacts effectively doubles resilience toward contacts which are not observed in the native contact map. Furthermore, this knowledge increases reconstruction fidelity on sparse contact maps significantly by 0.4 Å.

Proteins are constructed by the combination of a different number of amino acids and thus, have a different structure and folding depending on chemical reactions and other aspects. The protein folding prediction can help in many healthcare scenarios to foretell and prevent diseases. The different elements that form a protein give the secondary structure. One of the most common algorithms used for secondary structure prediction constitutes the Chou-Fasman method. This technique divides and in following analyses each amino acid in three different elements, which are Open image in new window -helices, Open image in new window -sheets and turns based on already known protein structures. Its aim is to predict the probability for which each of these elements will be formed. In this paper, we have used Chou-Fasman algorithm for extracting the probabilities of a series of amino acids in FASTA format. We make an analysis given all probabilities for any length of a human protein without any restriction as other existing tools.

Motivation To understand protein structure, folding and function fully and to design proteins de novo reliably, we must learn from natural protein structures that have been characterized experimentally. The number of protein structures available is large and growing exponentially, which makes this task challenging. Indeed, computational resources are becoming increasingly important for classifying and analyzing this resource. Here, we use tools from graph theory to define an Atlas classification scheme for automatically categorizing certain protein substructures. Results Focusing on the α-helical coiled coils, which are ubiquitous protein-structure and protein–protein interaction motifs, we present a suite of computational resources designed for analyzing these assemblies. iSOCKET enables interactive analysis of side-chain packing within proteins to identify coiled coils automatically and with considerable user control. Applying a graph theory-based Atlas classification scheme to structures identified by iSOCKET gives the Atlas of Coiled Coils, a fully automated, updated overview of extant coiled coils. The utility of this approach is illustrated with the first formal classification of an emerging subclass of coiled coils called α-helical barrels. Furthermore, in the Atlas, the known coiled-coil universe is presented alongside a partial enumeration of the ‘dark matter’ of coiled-coil structures; i.e. those coiled-coil architectures that are theoretically possible but have not been observed to date, and thus present defined targets for protein design. Availability and implementation iSOCKET is available as part of the open-source GitHub repository associated with this work (https://github.com/woolfson-group/isocket). This repository also contains all the data generated when classifying the protein graphs. The Atlas of Coiled Coils is available at: http://coiledcoils.chm.bris.ac.uk/atlas/app.

Protein structure is an important field of research, with particular significance in its potential applications in biomedicine and nanotechnology. In a recent study, we presented a general approach for comparing protein structures and origami models and demonstrated it with single-domain proteins. For example, the analysis of the α-helical barrel of the outer membrane protein A (OmpA) suggests that there are similar patterns between its structure and the Kresling origami model, providing insight into structure-activity relationships. Here we demonstrate that our approach can be expanded beyond single-domain proteins to also include multi-domain proteins, and to study dynamic processes of biomolecules. Two examples are given: (1) The eukaryotic chaperonin (TRiC) protein is compared with a newly generated origami model, and with an origami model that is constructed from two copies of the Flasher origami model, and (2) the CorA Magnesium transport system is compared with a newly generated origami model and with an origami model that combines the Kresling and Flasher origami models. Based on the analysis of the analog origami models, it is indicated that it is possible to identify building blocks for constructing assembled origami models that are analogous to protein structures. In addition, it is identified that the expansion/collapse mechanisms of the TRiC and CorA are auxetic. Namely, these proteins require a single motion for synchronized folding along two or three axes.

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.

Protein energy landscapes are highly complex, yet the vast majority of states within them tend to be invisible to experimentalists. Here, using site-directed mutagenesis and exploiting the simplicity of tandem-repeat protein structures, we delineate a network of these states and the routes between them. We show that our target, gankyrin, a 226-residue 7-ankyrin-repeat protein, can access two alternative (un)folding pathways. We resolve intermediates as well as transition states, constituting a comprehensive series of snapshots that map early and late stages of the two pathways and show both to be polarized such that the repeat array progressively unravels from one end of the molecule or the other. Strikingly, we find that the protein folds via one pathway but unfolds via a different one. The origins of this behavior can be rationalized using the numerical results of a simple statistical mechanics model that allows us to visualize the equilibrium behavior as well as single-molecule folding/unfolding trajectories, thereby filling in the gaps that are not accessible to direct experimental observation. Our study highlights the complexity of repeat-protein folding arising from their symmetrical structures; at the same time, however, this structural simplicity enables us to dissect the complexity and thereby map the precise topography of the energy landscape in full breadth and remarkable detail. That we can recapitulate the key features of the folding mechanism by computational analysis of the native structure alone will help toward the ultimate goal of designed amino-acid sequences with made-to-measure folding mechanisms-the Holy Grail of protein folding.

The secondary and tertiary structure of a protein has a primary role in determining its function. Even though many folding prediction algorithms have been developed in the past decades — mainly based on the assumption that folding instructions are encoded within the protein sequence — experimental techniques remain the most reliable to establish protein structures. In this paper, we searched for signals related to the formation of [Formula: see text]-helices. We carried out a statistical analysis on a large dataset of experimentally characterized secondary structure elements to find over- or under-occurrences of specific amino acids defining the boundaries of helical moieties. To validate our hypothesis, we trained various Machine Learning models, each equipped with an attention mechanism, to predict the occurrence of [Formula: see text]-helices. The attention mechanism allows to interpret the model’s decision, weighing the importance the predictor gives to each part of the input. The experimental results show that different models focus on the same subsequences, which can be seen as codes driving the secondary structure formation.

In cells, biosynthetic machinery coordinates protein synthesis and folding to optimize efficiency and minimize off-pathway outcomes. However, it has been difficult to delineate experimentally the mechanisms responsible. Using fluorescence resonance energy transfer, we studied cotranslational folding of the first nucleotide-binding domain from the cystic fibrosis transmembrane conductance regulator. During synthesis, folding occurred discretely via sequential compaction of N-terminal, α-helical, and α/β-core subdomains. Moreover, the timing of these events was critical; premature α-subdomain folding prevented subsequent core formation. This process was facilitated by modulating intrinsic folding propensity in three distinct ways: delaying α-subdomain compaction, facilitating β-strand intercalation, and optimizing translation kinetics via codon usage. Thus, de novo folding is translationally tuned by an integrated cellular response that shapes the cotranslational folding landscape at critical stages of synthesis.

Summary Models of symmetric protein evolution typically invoke gene duplication and fusion events, in which repetition of a structural motif generates foldable, stable symmetric protein architecture. Success of such evolutionary processes suggests that the duplicated structural motif must be capable of nucleating protein folding. If correct, symmetric expansion of a folding nucleus sequence derived from an extant symmetric fold may be an elegant and computationally tractable solution to de novo protein design. We report the efficient de novo design of a β-trefoil protein by symmetric expansion of a β-trefoil folding nucleus, previously identified by ɸ-value analysis. The resulting protein, having exact sequence symmetry, exhibits superior folding properties compared to its naturally evolved progenitor—with the potential for redundant folding nuclei. In principle, folding nucleus symmetric expansion can be applied to any given symmetric protein fold (that is, nearly one-third of the known proteome) provided information of the folding nucleus is available.

Summary: Wordom is a versatile program for manipulation of molecular dynamics trajectories and efficient analysis of simulations. Original tools in Wordom include a procedure to evaluate significance of sampling for principal component analysis as well as modules for clustering multiple conformations and evaluation of order parameters for folding and aggregation. The program was developed with special emphasis on user-friendliness, effortless addition of new modules and efficient handling of large sets of trajectories.Availability: The Wordom program is distributed with full source code (in the C language) and documentation for usage and further development as a platform-independent package under a GPL license from http://www.biochem-caflisch.unizh.ch/wordom/Contact: caflisch@bioc.unizh.ch

The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.

Motivation The molecular bases of protein stability remain far from elucidated even though substantial progress has been made through both computational and experimental investigations. One of the most challenging goals is the development of accurate prediction tools of the temperature dependence of the standard folding free energy ΔG(T). Such predictors have an enormous series of potential applications, which range from drug design in the biopharmaceutical sector to the optimization of enzyme activity for biofuel production. There is thus an important demand for novel, reliable and fast predictors. Results We present the SCooP algorithm, which is a significant step towards accurate temperature-dependent stability prediction. This automated tool uses the protein structure and the host organism as sole entries and predicts the full T-dependent stability curve of monomeric proteins assumed to follow a two-state folding transition. Equivalently, it predicts all the thermodynamic quantities associated to the folding transition, namely the melting temperature Tm, the standard folding enthalpy ΔHm measured at Tm, and the standard folding heat capacity ΔCp. The cross-validated performances are good, with correlation coefficients between predicted and experimental values equal to [0.80, 0.83, 0.72] for ΔHm, ΔCp and Tm, respectively, which increase up to [0.88, 0.90, 0.78] upon the removal of 10% outliers. Moreover, the stability curve prediction of a target protein is very fast: it takes less than a minute. SCooP can thus potentially be applied on a structurome scale. This opens new perspectives of large-scale analyses of protein stability, which is of considerable interest for protein engineering. Availability and implementation The SCooP webserver is freely available at http://babylone.ulb.ac.be/SCooP. Supplementary information Supplementary data are available at Bioinformatics online.

I describe how experimental studies of protein folding have led to advances in protein structure prediction and protein design. I describe the finding that protein sequences are not optimized for rapid folding, the contact order–protein folding rate correlation, the incorporation of experimental insights into protein folding into the Rosetta protein structure production methodology and the use of this methodology to determine structures from sparse experimental data. I then describe the inverse problem (protein design) and give an overview of recent work on designing proteins with new structures and functions. I also describe the contributions of the general public to these efforts through the Rosetta@home distributed computing project and the FoldIt interactive protein folding and design game.

For many years, scientists have been trying to unravel the protein folding process. This paper presents a proposition of an improvement to one of models trying to describe it, the elliptical model, developed by the Department of Bioinformatics and Telemedicine UJ-CM [22]. The model assumes a division of a protein folding process into two stages: the Early-Stage (ES) and the Late-Stage (LS). After the first stage, the second one sometimes occurs unable to perform, because of accidentally created clashes between atoms. This work demonstrates several possible solutions to remove clashes before proceeding to the LS. Additionally, one of presented solutions describes mathematically the precession phenomenon, what might be useful in other than protein folding field of studies such as medical imaging, quantum physics or astronomy.