Interaction potentials for protein folding

Inter-residue interactions in alpha-helical transmembrane proteins

MOTIVATION

The number of available membrane protein structures has markedly increased in the last years and, in parallel, the reliability of the methods to detect transmembrane (TM) segments. In the present report, we characterized inter-residue interactions in α-helical membrane proteins using a dataset of 3462 TM helices from 430 proteins. This is by far the largest analysis published to date.

RESULTS

Our analysis of residue-residue interactions in TM segments of membrane proteins shows that almost all interactions involve aliphatic residues and Phe. There is lack of polar-polar, polar-charged and charged-charged interactions except for those between Thr or Ser sidechains and the backbone carbonyl of aliphatic and Phe residues. The results are discussed in the context of the preferences of amino acids to be in the protein core or exposed to the lipid bilayer and to occupy specific positions along the TM segment. Comparison to datasets of β-barrel membrane proteins and of α-helical globular proteins unveils the specific patterns of interactions and residue composition characteristic of α-helical membrane proteins that are the clue to understanding their structure.

AVAILABILITY AND IMPLEMENTATION

Results data and datasets used are available at http://lmc.uab.cat/TMalphaDB/interactions.php.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Iterative derivation of effective potentials to sample the conformational space of proteins at atomistic scale

The current capacity of computers makes it possible to perform simulations of small systems with portable, explicit-solvent potentials achieving high degree of accuracy. However, simplified models must be employed to exploit the behavior of large systems or to perform systematic scans of smaller systems. While powerful algorithms are available to facilitate the sampling of the conformational space, successful applications of such models are hindered by the availability of simple enough potentials able to satisfactorily reproduce known properties of the system. We develop an interatomic potential to account for a number of properties of proteins in a computationally economic way. The potential is defined within an all-atom, implicit solvent model by contact functions between the different atom types. The associated numerical values can be optimized by an iterative Monte Carlo scheme on any available experimental data, provided that they are expressible as thermal averages of some conformational properties. We test this model on three different proteins, for which we also perform a scan of all possible point mutations with explicit conformational sampling. The resulting models, optimized solely on a subset of native distances, not only reproduce the native conformations within a few Angstroms from the experimental ones, but show the cooperative transition between native and denatured state and correctly predict the measured free-energy changes associated with point mutations. Moreover, differently from other structure-based models, our method leaves a residual degree of frustration, which is known to be present in protein molecules.

Perspective: Coarse-grained models for biomolecular systems

By focusing on essential features, while averaging over less important details, coarse-grained (CG) models provide significant computational and conceptual advantages with respect to more detailed models. Consequently, despite dramatic advances in computational methodologies and resources, CG models enjoy surging popularity and are becoming increasingly equal partners to atomically detailed models. This perspective surveys the rapidly developing landscape of CG models for biomolecular systems. In particular, this review seeks to provide a balanced, coherent, and unified presentation of several distinct approaches for developing CG models, including top-down, network-based, native-centric, knowledge-based, and bottom-up modeling strategies. The review summarizes their basic philosophies, theoretical foundations, typical applications, and recent developments. Additionally, the review identifies fundamental inter-relationships among the diverse approaches and discusses outstanding challenges in the field. When carefully applied and assessed, current CG models provide highly efficient means for investigating the biological consequences of basic physicochemical principles. Moreover, rigorous bottom-up approaches hold great promise for further improving the accuracy and scope of CG models for biomolecular systems.

Another look at the conditions for the extraction of protein knowledge-based potentials

Protein knowledge-based potentials are effective free energies obtained from databases of known protein structures. They are used to parameterize coarse-grained protein models in many folding simulation and structure prediction methods. Two common approaches are used in the derivation of knowledge-based potentials. One assumes that the energy parameters optimize the native structure stability. The other assumes that interaction events are related to their energies according to the Boltzmann distribution, and that they are distributed independently of other events, that is, the quasi-chemical approximation. Here, these assumptions are systematically tested by extracting contact energies from artificial databases of lattice proteins with predefined pairwise contact energies. Databases of protein sequences are designed to either satisfy the Boltzmann distribution at high or low temperatures, or to simultaneously optimize the native stability and folding kinetics. It is found that the quasi-chemical approximation, with the ideal reference state, accurately reproduce the true energies for high temperature Boltzmann distributed sequences (weakly interacting residues), but less accurately at low temperatures, where the sequences correspond to energy minima and the residues are strongly interacting. To overcome this problem, an iterative procedure for Boltzmann distributed sequences is introduced, which accounts for interacting residue correlations and eliminates the need for the quasi-chemical approximation. In this case, the energies are accurately reproduced at any ensemble temperature. However, when the database of sequences designed for optimal stability and kinetics is used, the energy correlation is less than optimal using either method, exhibiting random and systematic deviations from linearity. Therefore, the assumption that native structures are maximally stable or that sequences are determined according to the Boltzmann distribution seems to be inadequate for obtaining accurate energies. The limited number of sequences in the database and the inhomogeneous concentration of amino acids from one structure to another do not seem to be major obstacles for improving the quality of the extracted pairwise energies, with the exception of repulsive interactions.

Inference of the solvation energy parameters of amino acids using maximum entropy approach

We present a novel technique, based on the principle of maximum entropy, for deriving the solvation energy parameters of amino acids from the knowledge of the solvent accessible areas in experimentally determined native state structures as well as high quality decoys of proteins. We present the results of detailed studies and analyze the correlations of the solvation energy parameters with the standard hydrophobic scale. We study the ability of the inferred parameters to discriminate between the native state structures of proteins and their decoy conformations.

Simple solvation potential for coarse-grained models of proteins

We formulate a simple solvation potential based on a coarsed-grained representation of amino acids with two spheres modeling the C(alpha) atom and an effective side-chain centroid. The potential relies on a new method for estimating the buried area of residues, based on counting the effective number of burying neighbors in a suitable way. This latter quantity shows a good correlation with the buried area of residues computed from all atom crystallographic structures. We check the discriminatory power of the solvation potential alone to identify the native fold of a protein from a set of decoys and show the potential to be considerably selective.

Inter-residue interactions in protein folding and stability

During the process of protein folding, the amino acid residues along the polypeptide chain interact with each other in a cooperative manner to form the stable native structure. The knowledge about inter-residue interactions in protein structures is very helpful to understand the mechanism of protein folding and stability. In this review, we introduce the classification of inter-residue interactions into short, medium and long range based on a simple geometric approach. The features of these interactions in different structural classes of globular and membrane proteins, and in various folds have been delineated. The development of contact potentials and the application of inter-residue contacts for predicting the structural class and secondary structures of globular proteins, solvent accessibility, fold recognition and ab initio tertiary structure prediction have been evaluated. Further, the relationship between inter-residue contacts and protein-folding rates has been highlighted. Moreover, the importance of inter-residue interactions in protein-folding kinetics and for understanding the stability of proteins has been discussed. In essence, the information gained from the studies on inter-residue interactions provides valuable insights for understanding protein folding and de novo protein design.

Teaching computers to fold proteins

A new general algorithm for optimization of potential functions for protein folding is introduced. It is based upon gradient optimization of the thermodynamic stability of native folds of a training set of proteins with known structure. The iterative update rule contains two thermodynamic averages which are estimated by (generalized ensemble) Monte Carlo. We test the learning algorithm on a Lennard-Jones (LJ) force field with a torsional angle degrees-of-freedom and a single-atom side-chain. In a test with 24 peptides of known structure, none folded correctly with the initial potential functions, but two-thirds came within 3 A to their native fold after optimizing the potential functions.

Assembly of protein tertiary structures from secondary structures using optimized potentials

We present a simulated annealing-based method for the prediction of the tertiary structures of proteins given knowledge of the secondary structure associated with each amino acid in the sequence. The backbone is represented in a detailed fashion whereas the sidechains and pairwise interactions are modeled in a simplified way, following the LINUS model of Srinivasan and Rose. A perceptron-based technique is used to optimize the interaction potentials for a training set of three proteins. For these proteins, the procedure is able to reproduce the tertiary structures to below 3 A in root mean square deviation (rmsd) from the PDB targets. We present the results of tests on twelve other proteins. For half of these, the lowest energy decoy has a rmsd from the native state below 6 A and, in 9 out of 12 cases, we obtain decoys whose rmsd from the native states are also well below 5 A.

Optimal potentials for predicting inter-helical packing in transmembrane proteins

A set of pairwise contact potentials between amino acid residues in transmembrane helices was determined from the known native structure of the transmembrane protein (TMP) bacteriorhodopsin by the method of perceptron learning, using Monte Carlo dynamics to generate suitable "decoy" structures. The procedure of finding these decoys is simpler than for globular proteins, since it is reasonable to assume that helices behave as independent, stable objects and, therefore, the search in the conformational space is greatly reduced. With the learnt potentials, the association of the helices in bacteriorhodopsin was successfully simulated. The folding of a second TMP (the helix-dimer glycophorin A) was then accomplished with only a refinement of the potentials from a small number of decoys.

Anisotropic effective interactions in a coarse-grained tube picture of proteins

Recent studies have shown that a coarse-grained description of a protein backbone represented as a tube of non-zero thickness captures many of the common characteristics of small globular proteins. Here we argue that such a physical picture leads to a prediction of inherently anisotropic amino acid interactions. In order to test this prediction, we have carried out an extensive analysis of a data bank made up of 600 proteins with low sequence homology and covering many different three-dimensional folds. This analysis, based on the study of the geometrical properties of the vectors joining next-nearest neighbor C(alpha) atoms along the chain, shows clearly that when amino acids are in contact, the distribution of their relative orientations is not random but exhibits peaks at specific angles whose values reflect, in general, the tubular nature of proteins and, more specifically, the nature of the secondary structure motifs, which are the building blocks of protein structures. Our results suggest that the incorporation of the relative orientation of amino acids in contact could play a vital role in simplified coarse-grained schemes for determining effective interaction parameters for use in folding, threading, and docking.

Design of an optimal Chebyshev-expanded discrimination function for globular proteins

We describe the construction of a scoring function designed to model the free energy of protein folding. An optimization technique is used to determine the best functional forms of the hydrophobic, residue-residue and hydrogen-bonding components of the potential. The scoring function is expanded by use of Chebyshev polynomials, the coefficients of which are determined by minimizing the score, in units of standard deviation, of native structures in the ensembles of alternate decoy conformations. The derived effective potential is then tested on decoy sets used conventionally in such studies. Using our scoring function, we achieve a high level of discrimination between correct and incorrect folds. In addition, our method is able to represent functions of arbitrary shape with fewer parameters than the usual histogram potentials of similar resolution. Finally, our representation can be combined easily with many optimization methods, because the total energy is a linear function of the parameters. Our results show that the techniques of Z-score optimization and Chebyshev expansion work well.

Learning effective amino acid interactions through iterative stochastic techniques

The prediction of the three-dimensional structures of the native states of proteins from the sequences of their amino acids is one of the most important challenges in molecular biology. An essential task for solving this problem within coarse-grained models is the deduction of effective interaction potentials between the amino acids. Over the years, several techniques have been developed to extract potentials that are able to discriminate satisfactorily between the native and nonnative folds of a preassigned protein sequence. In general, when these potentials are used in actual dynamical folding simulations, they lead to a drift of the native structure outside the quasinative basin. In this article, we present and validate an approach to overcome this difficulty. By exploiting several numerical and analytical tools, we set up a rigorous iterative scheme to extract potentials satisfying a prerequisite of any viable potential: the stabilization of proteins within their native basin (less than 3-4 A RMSD). The scheme is flexible and is demonstrated to be applicable to a variety of parameterizations of the energy function, and it provides in each case the optimal potentials.

A self-consistent knowledge-based approach to protein design

A simple and very efficient protein design strategy is proposed by developing some recently introduced theoretical tools which have been successfully applied to exactly solvable protein models. The design approach is implemented by using three amino acid classes and it is based on the minimization of an appropriate energy function. For a given native state the results of the design procedure are compared, through a statistical analysis, with the properties of an ensemble of sequences folding in the same conformation. If the success rate is computed on those sites designed with high confidence, it can be as high as 80%. The method is also able to identify key sites for the folding process: results for 2ci2 and barnase are in very good agreement with experimental results.

How to generate improved potentials for protein tertiary structure prediction: a lattice model study

Success in the protein structure prediction problem relies heavily on the choice of an appropriate potential function. One approach toward extracting these potentials from a database of known protein structures is to maximize the Z-score of the database proteins, which represents the ability of the potential to discriminate correct from random conformations. These optimization methods model the entire distribution of alternative structures, reducing their ability to concentrate on the lowest energy structures most competitive with the native state and resulting in an unfortunate tendency to underestimate the repulsive interactions. This leads to reduced accuracy and predictive ability. Using a lattice model, we demonstrate how we can weight the distribution to suppress the contributions of the high-energy conformations to the Z-score calculation. The result is a potential that is more accurate and more likely to yield correct predictions than other Z-score optimization methods as well as potentials of mean force.

Recurrent oligomers in proteins: an optimal scheme reconciling accurate and concise backbone representations in automated folding and design studies

A novel scheme is introduced to capture the spatial correlations of consecutive amino acids in naturally occurring proteins. This knowledge-based strategy is able to carry out optimally automated subdivisions of protein fragments into classes of similarity. The goal is to provide the minimal set of protein oligomers (termed "oligons" for brevity) that is able to represent any other fragment. At variance with previous studies in which recurrent local motifs were classified, our concern is to provide simplified protein representations that have been optimised for use in automated folding and/or design attempts. In such contexts, it is paramount to limit the number of degrees of freedom per amino acid without incurring loss of accuracy of structural representations. The suggested method finds, by construction, the optimal compromise between these needs. Several possible oligon lengths are considered. It is shown that meaningful classifications cannot be done for lengths greater than six or smaller than four. Different contexts are considered for which oligons of length five or six are recommendable. With only a few dozen oligons of such length, virtually any protein can be reproduced within typical experimental uncertainties. Structural data for the oligons are made publicly available.

Scoring functions in protein folding and design

We present an analysis of the assumptions behind some of the most commonly used methods for evaluating the goodness of the fit between a sequence and a structure. Our studies on a lattice model show that methods based on statistical considerations are easy to use and can capture some of the features of protein-like sequences and their corresponding native states, but unfortunately are incapable of recognizing, with certainty, the native-like conformation of a sequence among a set of decoys. Meanwhile, an optimization method, entailing the determination of the parameters of an effective free energy of interaction, is much more reliable in recognizing the native state of a sequence. However, the statistical method is shown to perform quite well in tests of protein design.

Can a pairwise contact potential stabilize native protein folds against decoys obtained by threading?

We present a method to derive contact energy parameters from large sets of proteins. The basic requirement on which our method is based is that for each protein in the database the native contact map has lower energy than all its decoy conformations that are obtained by threading. Only when this condition is satisfied one can use the proposed energy function for fold identification. Such a set of parameters can be found (by perceptron learning) if Mp, the number of proteins in the database, is not too large. Other aspects that influence the existence of such a solution are the exact definition of contact and the value of the critical distance Rc, below which two residues are considered to be in contact. Another important novel feature of our approach is its ability to determine whether an energy function of some suitable proposed form can or cannot be parameterized in a way that satisfies our basic requirement. As a demonstration of this, we determine the region in the (Rc, Mp) plane in which the problem is solvable, i.e., we can find a set of contact parameters that stabilize simultaneously all the native conformations. We show that for large enough databases the contact approximation to the energy cannot stabilize all the native folds even against the decoys obtained by gapless threading.

Simple model to study insertion of a protein into a membrane

A simple coarse grained model on a two-dimensional lattice is presented to elucidate the main effects ruling the insertion of a protein into a polar environment such as a lipidic membrane. The amino acids are divided into two classes (hydrophobic or polar), and they behave differently according to their surroundings. In aqueous solution the hydrophobic amino acids are forced to minimize contacts with water, whereas in the apolar environment all the amino acids try to aggregate regardless to their specificity. The lattice is employed in order to perform exact calculations and to generate a fictitious protein data bank. Despite the simplicity of the model, some morphological features of the protein-like lattice structures obtained by our model are compatible with the observed phenomenology of transmembrane proteins. These results seem to corroborate the hypothesis that the number of classes into which the amino acids can be divided that correctly describe the phenomena may be extremely low.

Folding Lennard-Jones proteins by a contact potential

We studied the possibility to approximate a Lennard-Jones interaction by a pairwise contact potential. First we used a Lennard-Jones potential to design off-lattice, protein-like heteropolymer sequences, whose lowest energy (native) conformations were then identified by molecular dynamics. Then we turned to investigate whether one can find a pairwise contact potential, whose ground states are the contact maps associated with these native conformations. We show that such a requirement cannot be satisfied exactly, i.e., no such contact parameters exist. Nevertheless, we found that one can find contact energy parameters for which an energy minimization procedure, acting in the space of contact maps, yields maps whose corresponding structures are close to the native ones. Finally, we show that when these structures are used as the initial point of a molecular dynamics energy minimization process, the correct native folds are recovered with high probability.

Protein ground state candidates in a simple model: an enumeration study

The concept of the reduced set of contact maps is introduced. Using this concept we find the ground state candidates for a hydrophobic-polar lattice model on a two-dimensional square lattice. Using these results we exactly enumerate the native states of all proteins for a wide range of energy parameters. In this way, we show that there are some sequences which have an absolute native state. Moreover, we study the scale dependence of the number of members of the reduced set, the number of ground state candidates, and the number of perfectly stable sequences by comparing the results for sequences with lengths of 6 up to 20.