An empirical energy function for threading protein sequence through the folding motif

In this paper we present a new residue contact potantial derived by statistical analysis of protein crystal structures. This gives mean hydrophobic and pairwise contact energies as a function of residue type and distance interval. To test the accuracy of this potential we generate model structures by “threading” different sequences through backbone folding motifs found in the structural data base. We find that conformational energies calculated by summing contact potentials show perfect specificity in matching the correct sequences with each globular folding motif in a 161-protcin data set. They also identify correct models with the core folding motifs of heme-rythrin and immunoglobulin McPC603 V₁-do- main, among millions of alternatives possible when we align subsequences with α-helices and β-strands, and allow for variation in the lengths of intervening loops. We suggest that contact potentials reflect important constraints on nonbonded interaction in native proteins, and that “threading” may be useful for structure prediction by recognition of folding motif. © 1993 Wiley-Liss, Inc.     

Exploring the relationship between funneled energy landscapes and two-state protein folding

It should take an astronomical time span for unfolded protein chains to find their native state based on an unguided conformational random search. The experimental observation that folding is fast can be rationalized by assuming that protein energy landscapes are sloped towards the native state minimum, such that rapid folding can proceed from virtually any point in conformational space. Folding transitions often exhibit two-state behavior, involving extensively disordered and highly structured conformers as the only two observable kinetic species. This study employs a simple Brownian dynamics model of "protein particles" moving in a spherically symmetrical potential. As expected, the presence of an overall slope towards the native state minimum is an effective means to speed up folding. However, the two-state nature of the transition is eradicated if a significant energetic bias extends too far into the non-native conformational space. The breakdown of two-state cooperativity under these conditions is caused by a continuous conformational drift of the unfolded proteins. Ideal two-state behavior can only be maintained on surfaces exhibiting large regions that are energetically flat, a result that is supported by other recent data in the literature (Kaya and Chan, Proteins: Struct Funct Genet 2003;52:510-523). Rapid two-state folding requires energy landscapes exhibiting the following features: (i) A large region in conformational space that is energetically flat, thus allowing for a significant degree of random sampling, such that unfolded proteins can retain a random coil structure; (ii) a trapping area that is strongly sloped towards the native state minimum.     

Probabilistic sampling of protein conformations: New hope for brute force?

Protein structure prediction from sequence alone by "brute force" random methods is a computationally expensive problem. Estimates have suggested that it could take all the computers in the world longer than the age of the universe to compute the structure of a single 200-residue protein. Here we investigate the use of a faster version of our FOLDTRAJ probabilistic all-atom protein-structure-sampling algorithm. We have improved the method so that it is now over twenty times faster than originally reported, and capable of rapidly sampling conformational space without lattices. It uses geometrical constraints and a Leonard-Jones type potential for self-avoidance. We have also implemented a novel method to add secondary structure-prediction information to make protein-like amounts of secondary structure in sampled structures. In a set of 100,000 probabilistic conformers of 1VII, 1ENH, and 1PMC generated, the structures with smallest Calpha RMSD from native are 3.95, 5.12, and 5.95A, respectively. Expanding this test to a set of 17 distinct protein folds, we find that all-helical structures are "hit" by brute force more frequently than beta or mixed structures. For small helical proteins or very small non-helical ones, this approach should have a "hit" close enough to detect with a good scoring function in a pool of several million conformers. By fitting the distribution of RMSDs from the native state of each of the 17 sets of conformers to the extreme value distribution, we are able to estimate the size of conformational space for each. With a 0.5A RMSD cutoff, the number of conformers is roughly 2N where N is the number of residues in the protein. This is smaller than previous estimates, indicating an average of only two possible conformations per residue when sterics are accounted for. Our method reduces the effective number of conformations available at each residue by probabilistic bias, without requiring any particular discretization of residue conformational space, and is the fastest method of its kind. With computer speeds doubling every 18 months and parallel and distributed computing becoming more practical, the brute force approach to protein structure prediction may yet have some hope in the near future.     

Nonlinearities in protein space limit the utility of informatics in protein biophysics

We examine the utility of informatic‐based methods in computational protein biophysics. To do so, we use newly developed metric functions to define completely independent sequence and structure spaces for a large database of proteins. By investigating the relationship between these spaces, we demonstrate quantitatively the limits of knowledge‐based correlation between the sequences and structures of proteins. It is shown that there are well‐defined, nonlinear regions of protein space in which dissimilar structures map onto similar sequences (the conformational switch), and dissimilar sequences map onto similar structures (remote homology). These nonlinearities are shown to be quite common—almost half the proteins in our database fall into one or the other of these two regions. They are not anomalies, but rather intrinsic properties of structural encoding in amino acid sequences. It follows that extreme care must be exercised in using bioinformatic data as a basis for computational structure prediction. The implications of these results for protein evolution are examined. Proteins 2015; 83:1923–1928. © 2015 Wiley Periodicals, Inc.     

Limited conformational space for early-stage protein folding simulation

MOTIVATION: The problem of early-stage protein folding is critical for protein structure prediction. The model presented introduces a common definition of protein structures which may be treated as the possible in silico early-stage form of the polypeptide chain. Limitation of the conformational space to the ellipse path on the Ramachandran map was tested as a possible sub-space to represent the early-stage structure for simulation of protein folding. The proposed conformational sub-space was developed on the basis of the backbone conformation, with side-chain interactions excluded. RESULTS: The ellipse-path-limited conformation of BPTI was created using the criterion of shortest distance between Phi, Psi angles in native form of protein and the Phi, Psi angles belonging to the ellipse. No knots were observed in the structure created according to ellipse-path conformational sub-space. The energy minimization procedure applied to ellipse-path derived conformation directed structural changes toward the native form of the protein with SS-bonds system introduced to the procedure. AVAILABILITY: Program 'Ellipse' to create the ellipse-path derived structure available on request: myroterm@cyf-kr.edu.pl     

A new protein folding recognition potential function

On the study of protein inverse folding problem, one goal is to find simple and efficient potential to evaluate the compatibility between structure and a given sequence. We present here a novo empirical mean force potential to address the importance of electrostatic interactions in protein inverse folding study. It is based on protein main chain polar fraction and constructed in a way similar with Sippl's from a database of 64 known independent three-dimensional protein structures. This potential was applied to recognize the protein native conformations among a conformation pool. Calculated results show that this potential is powerful in picking out native conformations, in addition it can also find structure similarity between proteins with low sequence similarity. The success of this new potential clearly shows the importance of electrostatic factors in protein inverse folding studies. © 1995 Wiley-Liss, Inc.     

A new method for mapping discontinuous antibody epitopes to reveal structural features of proteins.

Antibodies that bind to protein surfaces of interest can be used to report the three-dimensional structure of the protein as follows: Proteins are composed of linear polypeptide chains that fold together in complex spatial patterns to create the native protein structure. These folded structures form binding sites for antibodies. Antibody binding sites are typically "assembled" on the protein surface from segments that are far apart in the primary amino acid sequence of the target proteins. Short amino acid probe sequences that bind to the active region of each antibody can be used as witnesses to the antibody epitope surface and these probes can be efficiently selected from random sequence peptide libraries. This paper presents a new method to align these antibody epitopes to discontinuous regions of the one-dimensional amino acid sequence of a target protein. Such alignments of the epitopes indicate how segments of the protein sequence must be folded together in space and thus provide long-range constraints for solving the 3-D protein structure. This new antibody-based approach is applicable to the large fraction of proteins that are refractory to current approaches for structure determination and has the additional advantage of requiring very small amounts of the target protein. The binding site of an antibody is a surface, not just a continuous linear sequence, so the epitope mapping alignment problem is outside the scope of classical string alignment algorithms, such as Smith-Waterman. We formalize the alignment problem that is at the heart of this new approach, prove that the epitope mapping alignment problem is NP-complete, and give some initial results using a branch-and-bound algorithm to map two real-life cases. Initial results for two validation cases are presented for a graph-based protein surface neighbor mapping procedure that promises to provide additional spatial proximity information for the amino acid residues on the protein surface.     

Theory of protein folding

Protein folding should be complex. Proteins organize themselves into specific three-dimensional structures, through a myriad of conformational changes. The classical view of protein folding describes this process as a nearly sequential series of discrete intermediates. In contrast, the energy landscape theory of folding considers folding as the progressive organization of an ensemble of partially folded structures through which the protein passes on its way to the natively folded structure. As a result of evolution, proteins have a rugged funnel-like landscape biased toward the native structure. Connecting theory and simulations of minimalist models with experiments has completely revolutionized our understanding of the underlying mechanisms that control protein folding.     

Finding the needle in the haystack: towards solving the protein-folding problem computationally

Prediction of protein tertiary structures from amino acid sequence and understanding the mechanisms of how proteins fold, collectively known as “the protein folding problem,” has been a grand challenge in molecular biology for over half a century. Theories have been developed that provide us with an unprecedented understanding of protein folding mechanisms. However, computational simulation of protein folding is still difficult, and prediction of protein tertiary structure from amino acid sequence is an unsolved problem. Progress toward a satisfying solution has been slow due to challenges in sampling the vast conformational space and deriving sufficiently accurate energy functions. Nevertheless, several techniques and algorithms have been adopted to overcome these challenges, and the last two decades have seen exciting advances in enhanced sampling algorithms, computational power and tertiary structure prediction methodologies. This review aims at summarizing these computational techniques, specifically conformational sampling algorithms and energy approximations that have been frequently used to study protein-folding mechanisms or to de novo predict protein tertiary structures. We hope that this review can serve as an overview on how the protein-folding problem can be studied computationally and, in cases where experimental approaches are prohibitive, help the researcher choose the most relevant computational approach for the problem at hand. We conclude with a summary of current challenges faced and an outlook on potential future directions.     

Routes are trees: the parsing perspective on protein folding

An important puzzle in structural biology is the question of how proteins are able to fold so quickly into their unique native structures. There is much evidence that protein folding is hierarchic. In that case, folding routes are not linear, but have a tree structure. Trees are commonly used to represent the grammatical structure of natural language sentences, and chart parsing algorithms efficiently search the space of all possible trees for a given input string. Here we show that one such method, the CKY algorithm, can be useful both for providing novel insight into the physical protein folding process, and for computational protein structure prediction. As proof of concept, we apply this algorithm to the HP lattice model of proteins. Our algorithm identifies all direct folding route trees to the native state and allows us to construct a simple model of the folding process. Despite its simplicity, our model provides an account for the fact that folding rates depend only on the topology of the native state but not on sequence composition.     

Acetylcholinesterase in motion: visualizing conformational changes in crystal structures by a morphing procedure

In order to visualize and appreciate conformational changes between homologous three-dimensional (3D) protein structures or protein/inhibitor complexes, we have developed a user-friendly morphing procedure. It enabled us to detect coordinated conformational changes not easily discernible by analytic methods or by comparison of static images. This procedure was applied to comparison of native Torpedo californica acetylcholinesterase and of complexes with reversible inhibitors and conjugates with covalent inhibitors. It was likewise shown to be valuable for the visualization of conformational differences between acetylcholinesterases from different species. The procedure involves generation, in Cartesian space, of 25 interpolated intermediate structures between the initial and final 3D structures, which then serve as the individual frames in a QuickTime movie.     

The illusive search for the lowest free energy state of globular proteins and RNAs

As a consequence of the one-dimensional storage and transfer of genetic information, DNA → RNA → protein, the process by which globular proteins and RNAs achieve their three-dimensional structure involves folding of a linear chain. The folding process itself could create massive activation barriers that prevent the attainment of many stable protein and RNA structures. We consider several kinds of energy barriers inherent in folding that might serve as kinetic constraints to achieving the lowest energy state. Alternative approaches to forming 3D structure, where a substantial number of weak interactions would be created prior to the formation of all the peptide (or phosphodiester) bonds, might not be subjected to such high barriers. This could lead to unique 3D conformational states, potentially more stable than “native” proteins and RNAs, with new functionalities.     

Distributions in protein conformation space: implications for structure prediction and entropy

By considering how polymer structures are distributed in conformation space, we show that it is possible to quantify the difficulty of structural prediction and to provide a measure of progress for prediction calculations. The critical issue is the probability that a conformation is found within a specified distance of another conformer. We address this question by constructing a cumulative distribution function (CDF) for the average probability from observations about its limiting behavior at small displacements and numerical simulations of polyalanine chains. We can use the CDF to estimate the likelihood that a structure prediction is better than random chance. For example, the chance of randomly predicting the native backbone structure of a 150-amino-acid protein to low resolution, say within 6 A, is 10(-14). A high-resolution structural prediction, say to 2 A, is immensely more difficult (10(-57)). With additional assumptions, the CDF yields the conformational entropy of protein folding from native-state coordinate variance. Or, using values of the conformational entropy change on folding, we can estimate the native state's conformational span. For example, for a 150-mer protein, equilibrium alpha-carbon displacements in the native ensemble would be 0.3-0.5 A based on T Delta S of 1.42 kcal/(mol residue).     

三肽和四肽构象空间的可视化方法

研究蛋白质寡肽构象在构象空间中的分布情况,对提取寡肽模式并构建短肽库具有重要意义。通过构建一个保距映射,将以主链原子均方根距离(root mean square distance,RMSD)为距离测度的三肽构象空间变换为一维直线上的欧氏距离空间,从而直观地展现三肽构象的聚集情况,表明三肽主链构象可以用单一变量编码。应用该特性对四肽的构象空间加以分析,将四肽构象映射到三维空间中,从而以可视的方式描述四肽构象空间的聚集情况。对短肽构象空间的初步分析表明,短肽的聚集性和二级结构有着密切的联系。在四肽构象空间中存在有自然边界的离散区域(与螺旋等结构相关),也有一些区域(与折叠等结构有关)难以进一步划分。这种方法也为以可视方式分析高维空间中肽段的聚集性给出了一种可能的方案。     

Entropy capacity determines protein folding

Search and study of the general principles that govern kinetics and thermodynamics of protein folding generate a new insight into the factors controlling this process. Here, based on the known experimental data and using theoretical modeling of protein folding, we demonstrate that there exists an optimal relationship between the average conformational entropy and the average energy of contacts per residue-that is, an entropy capacity-for fast protein folding. Statistical analysis of conformational entropy and number of contacts per residue for 5829 protein structures from four general structural classes (all-alpha, all-beta, alpha/beta, alpha+beta) demonstrates that each class of proteins has its own class-specific average number of contacts (class alpha/beta has the largest number of contacts) and average conformational entropy per residue (class all-alpha has the largest number of rotatable angles phi, psi, and chi per residue). These class-specific features determine the folding rates: alpha proteins are the fastest folding proteins, then follow beta and alpha+beta proteins, and finally alpha/beta proteins are the slowest ones. Our result is in agreement with the experimental folding rates for 60 proteins. This suggests that structural and sequence properties are important determinants of protein folding rates.     

Network properties of protein-decoy structures

Convergence of the vast sequence space of proteins into a highly restricted fold/conformational space suggests a simple yet unique underlying mechanism of protein folding that has been the subject of much debate in the last several decades. One of the major challenges related to the understanding of protein folding or in silico protein structure prediction is the discrimination of non-native structures/decoys from the native structure. Applications of knowledge-based potentials to attain this goal have been extensively reported in the literature. Also, scoring functions based on accessible surface area and amino acid neighbourhood considerations were used in discriminating the decoys from native structures. In this article, we have explored the potential of protein structure network (PSN) parameters to validate the native proteins against a large number of decoy structures generated by diverse methods. We are guided by two principles: (a) the PSNs capture the local properties from a global perspective and (b) inclusion of non-covalent interactions, at all-atom level, including the side-chain atoms, in the network construction accommodates the sequence dependent features. Several network parameters such as the size of the largest cluster, community size, clustering coefficient are evaluated and scored on the basis of the rank of the native structures and the Z-scores. The network analysis of decoy structures highlights the importance of the global properties contributing to the uniqueness of native structures. The analysis also exhibits that the network parameters can be used as metrics to identify the native structures and filter out non-native structures/decoys in a large number of data-sets; thus also has a potential to be used in the protein ‘structure prediction’ problem.     

Network properties of protein-decoy structures

Convergence of the vast sequence space of proteins into a highly restricted fold/conformational space suggests a simple yet unique underlying mechanism of protein folding that has been the subject of much debate in the last several decades. One of the major challenges related to the understanding of protein folding or in silico protein structure prediction is the discrimination of non-native structures/decoys from the native structure. Applications of knowledge-based potentials to attain this goal have been extensively reported in the literature. Also, scoring functions based on accessible surface area and amino acid neighbourhood considerations were used in discriminating the decoys from native structures. In this article, we have explored the potential of protein structure network (PSN) parameters to validate the native proteins against a large number of decoy structures generated by diverse methods. We are guided by two principles: (a) the PSNs capture the local properties from a global perspective and (b) inclusion of non-covalent interactions, at all-atom level, including the side-chain atoms, in the network construction accommodates the sequence dependent features. Several network parameters such as the size of the largest cluster, community size, clustering coefficient are evaluated and scored on the basis of the rank of the native structures and the Z-scores. The network analysis of decoy structures highlights the importance of the global properties contributing to the uniqueness of native structures. The analysis also exhibits that the network parameters can be used as metrics to identify the native structures and filter out non-native structures/decoys in a large number of data-sets; thus also has a potential to be used in the protein 'structure prediction' problem.     

Sampling Bottlenecks in De novo Protein Structure Prediction

The primary obstacle to de novo protein structure prediction is conformational sampling: the native state generally has lower free energy than nonnative structures but is exceedingly difficult to locate. Structure predictions with atomic level accuracy have been made for small proteins using the Rosetta structure prediction method, but for larger and more complex proteins, the native state is virtually never sampled, and it has been unclear how much of an increase in computing power would be required to successfully predict the structures of such proteins. In this paper, we develop an approach to determining how much computer power is required to accurately predict the structure of a protein, based on a reformulation of the conformational search problem as a combinatorial sampling problem in a discrete feature space. We find that conformational sampling for many proteins is limited by critical “linchpin” features, often the backbone torsion angles of individual residues, which are sampled very rarely in unbiased trajectories and, when constrained, dramatically increase the sampling of the native state. These critical features frequently occur in less regular and likely strained regions of proteins that contribute to protein function. In a number of proteins, the linchpin features are in regions found experimentally to form late in folding, suggesting a correspondence between folding in silico and in reality.     

Enhanced sampling near the native conformation using statistical potentials for local side-chain and backbone interactions

In the preceding article in this issue of Proteins, an empirical energy function consisting of 4 statistical potentials that quantify local side-chain-backbone and side-chain-side-chain interactions has been demonstrated to successfully identify the native conformations of short sequence fragments and the native structure within large sets of high-quality decoys. Because this energy function consists entirely of interactions between residues separated by fewer than 5 positions, it can be used at the earliest stage of ab initio structure prediction to enhance the efficiency of conformational search. In this article, protein fragments are generated de novo by recombining very short segments of protein structures (2, 4, or 6 residues), either selected at random or optimized with respect this local energy function. When local energy is optimized in selected fragments, more efficient sampling of conformational space near the native conformation is consistently observed for 450 randomly selected single turn fragments, with turn lengths varying from 3 to 12 residues and all 4 combinations of flanking secondary structure. These results further demonstrate the energetic significance of local interactions in protein conformations. When used in combination with longer range energy functions, application of these potentials should lead to more accurate prediction of protein structure.     

Optimal ratio between the average conformational entropy and the average energy of interaction between residues for fast protein folding

Based on available experimental data and using a theoretical model of protein folding, we demonstrate that there is an optimal ratio between the average conformational entropy and the average contact energy per residue for fast protein folding. A statistical analysis of the conformational entropy and the number of contacts per residue for 5829 protein domains from four main classes (α, β, α/β, α+β) shows that each class has its own characteristic average number of contacts per residue and average conformational entropy per residue. These class-specific characteristics determine the protein folding rates: α-proteins are the fastest to fold, β-proteins are the second fastest, α+β-proteins are the third, and α/β-proteins are the last to fold.