A novel method for sampling alpha-helical protein backbones

SSThread: Template-free protein structure prediction by threading pairs of contacting secondary structures followed by assembly of overlapping pairs

Acquiring the three-dimensional structure of a protein from its amino acid sequence alone, despite a great deal of work and significant progress on the subject, is still an unsolved problem. SSThread, a new template-free algorithm is described here that consists of making several predictions of contacting pairs of α-helices and β-strands derived from a database of experimental structures using a knowledge-based potential, secondary structure prediction, and contact map prediction followed by assembly of overlapping pair predictions to create an ensemble of core structure predictions whose loops are then predicted. In a set of seven CASP10 targets SSThread outperformed the two leading methods for two targets each. The targets were all β-strand containing structures and most of them have a high relative contact order which demonstrates the advantages of SSThread. The primary bottlenecks based on sets of 74 and 21 test cases are the pair prediction and loop prediction stages.

Assessing protein conformational sampling methods based on bivariate lag-distributions of backbone angles

Despite considerable progress in the past decades, protein structure prediction remains one of the major unsolved problems in computational biology. Angular-sampling-based methods have been extensively studied recently due to their ability to capture the continuous conformational space of protein structures. The literature has focused on using a variety of parametric models of the sequential dependencies between angle pairs along the protein chains. In this article, we present a thorough review of angular-sampling-based methods by assessing three main questions: What is the best distribution type to model the protein angles? What is a reasonable number of components in a mixture model that should be considered to accurately parameterize the joint distribution of the angles? and What is the order of the local sequence-structure dependency that should be considered by a prediction method? We assess the model fits for different methods using bivariate lag-distributions of the dihedral/planar angles. Moreover, the main information across the lags can be extracted using a technique called Lag singular value decomposition (LagSVD), which considers the joint distribution of the dihedral/planar angles over different lags using a nonparametric approach and monitors the behavior of the lag-distribution of the angles using singular value decomposition. As a result, we developed graphical tools and numerical measurements to compare and evaluate the performance of different model fits. Furthermore, we developed a web-tool (http://www.stat.tamu.edu/∼madoliat/LagSVD) that can be used to produce informative animations.

A computational pathway for bracketing native-like structures fo small alpha helical globular proteins

Impressive advances in the applications of bioinformatics for protein structure prediction coupled with growing structural databases on one hand and the insurmountable time-scale problem with ab initio computational methods on the other continue to raise doubts whether a computational solution to the protein folding problem--categorized as an NP-hard problem--is within reach in the near future. Combining some specially designed biophysical filters and vector algebra tools with ab initio methods, we present here a promising computational pathway for bracketing native-like structures of small alpha helical globular proteins departing from secondary structural information. The automated protocol is initiated by generating multiple structures around the loops between secondary structural elements. A set of knowledge-based biophysical filters namely persistence length and radius of gyration, developed and calibrated on approximately 1000 globular proteins, is introduced to screen the trial structures to filter out improbable candidates for the native and reduce the size of the library of probable structures. The ensemble so generated encompasses a few structures with native-like topology. Monte Carlo optimizations of the loop dihedrals are then carried out to remove steric clashes. The resultant structures are energy minimized and ranked according to a scoring function tested previously on a series of decoy sets vis-a-vis their corresponding natives. We find that the 100 lowest energy structures culled from the ensemble of energy optimized trial structures comprise at least a few to within 3-5 angstroms of the native. Thus the formidable "needle in a haystack" problem is narrowed down to finding an optimal solution amongst a computationally tractable number of alternatives. Encouraging results obtained on twelve small alpha helical globular proteins with the above outlined pathway are presented and discussed.

Modeling ensembles of transmembrane beta-barrel proteins

Transmembrane beta-barrel (TMB) proteins are embedded in the outer membrane of gram-negative bacteria, mitochondria, and chloroplasts. Despite their importance, very few nonhomologous TMB structures have been determined by X-ray diffraction because of the experimental difficulty encountered in crystallizing transmembrane proteins. We introduce the program partiFold to investigate the folding landscape of TMBs. By computing the Boltzmann partition function, partiFold estimates inter-beta-strand residue interaction probabilities, predicts contacts and per-residue X-ray crystal structure B-values, and samples conformations from the Boltzmann low energy ensemble. This broad range of predictive capabilities is achieved using a single, parameterizable grammatical model to describe potential beta-barrel supersecondary structures, combined with a novel energy function of stacked amino acid pair statistical potentials. PartiFold outperforms existing programs for inter-beta-strand residue contact prediction on TMB proteins, offering both higher average predictive accuracy as well as more consistent results. Moreover, the integration of these contact probabilities inside a stochastic contact map can be used to infer a more meaningful picture of the TMB folding landscape, which cannot be achieved with other methods. Partifold's predictions of B-values are competitive with recent methods specifically designed for this problem. Finally, we show that sampling TMBs from the Boltzmann ensemble matches the X-ray crystal structure better than single structure prediction methods. A webserver running partiFold is available at http://partiFold.csail.mit.edu/.

Iterative assembly of helical proteins by optimal hydrophobic packing

We present a method for the computer-based iterative assembly of native-like tertiary structures of helical proteins from alpha-helical fragments. For any pair of helices, our method, called MATCHSTIX, first generates an ensemble of possible relative orientations of the helices with various ways to form hydrophobic contacts between them. Those conformations having steric clashes, or a large radius of gyration of hydrophobic residues, or with helices too far separated to be connected by the intervening linking region, are discarded. Then, we attempt to connect the two helical fragments by using a robotics-based loop-closure algorithm. When loop closure is feasible, the algorithm generates an ensemble of viable interconnecting loops. After energy minimization and clustering, we use a representative set of conformations for further assembly with the remaining helices, adding one helix at a time. To efficiently sample the conformational space, the order of assembly generally proceeds from the pair of helices connected by the shortest loop, followed by joining one of its adjacent helices, always proceeding with the shorter connecting loop. We tested MATCHSTIX on 28 helical proteins each containing up to 5 helices and found it to heavily sample native-like conformations. The average rmsd of the best conformations for the 17 helix-bundle proteins that have 2 or 3 helices is less than 2 A; errors increase somewhat for proteins containing more helices. Native-like states are even more densely sampled when disulfide bonds are known and imposed as restraints. We conclude that, at least for helical proteins, if the secondary structures are known, this rapid rigid-body maximization of hydrophobic interactions can lead to small ensembles of highly native-like structures. It may be useful for protein structure prediction.

Probing protein fold space with a simplified model

We probe the stability and near-native energy landscape of protein fold space using powerful conformational sampling methods together with simple reduced models and statistical potentials. Fold space is represented by a set of 280 protein domains spanning all topological classes and having a wide range of lengths (33-300 residues) amino acid composition and number of secondary structural elements. The degrees of freedom are taken as the loop torsion angles. This choice preserves the native secondary structure but allows the tertiary structure to change. The proteins are represented by three-point per residue, three-dimensional models with statistical potentials derived from a knowledge-based study of known protein structures. When this space is sampled by a combination of parallel tempering and equi-energy Monte Carlo, we find that the three-point model captures the known stability of protein native structures with stable energy basins that are near-native (all alpha: 4.77 A, all beta: 2.93 A, alpha/beta: 3.09 A, alpha+beta: 4.89 A on average and within 6 A for 71.41%, 92.85%, 94.29% and 64.28% for all-alpha, all-beta, alpha/beta and alpha+beta, classes, respectively). Denatured structures also occur and these have interesting structural properties that shed light on the different landscape characteristics of alpha and beta folds. We find that alpha/beta proteins with alternating alpha and beta segments (such as the beta-barrel) are more stable than proteins in other fold classes.

Evaluation of coarse grained models for hydrogen bonds in proteins

Backbone hydrogen bonds contribute very importantly to the stability of proteins and therefore they must be appropriately represented in protein folding simulations. Simple models are frequently used in theoretical approaches to this process, but their simplifications are often confronted with the need to be true to the physics of the interactions. Here we study the effects of different levels of coarse graining in the modeling of backbone hydrogen bonds. We study three different models taken from the bibliography in a twofold fashion. First, we calculate the hydrogen bonds in 2gb1, an (alpha + beta)-protein, and see how different backbone representations and potentials can mimic the effects of real hydrogen bonds both in helices and sheets. Second, we use an evolutionary method for protein fragment assembly to locate the global energy minimum for a set of small beta-proteins with these models. This way, we assess the effects of coarse graining in hydrogen bonding models and show what can be expected from them when used in simulation experiments.

Computational design of proteins stereochemically optimized in size, stability, and folding speed

Artificial proteins potentially barrier-free in the folding kinetics are approached computationally under the guidance of protein-folding theories. The smallest and fastest folding globular protein triple-helix-bundle (THB) is so modified as to minimize or eliminate its presumed barriers in folding speed. As the barriers may reside in the ordering of either secondary or tertiary structure, the elements of both secondary and tertiary structure in the protein are targeted for prenucleation with suitable stereochemically constrained amino acid residues. The required elements of topology and sequence for the THB are optimized independently; first the topology is optimized with simulated annealing in polypeptides of highly simplified alphabet; next, the sequence in side chains is optimized using the standard inverse design methods. The resultant three best-adapted THBs, variable in topology and distinctive in sequences, are assessed by comparing them with a few benchmark proteins. The results of mainly molecular dynamics (MD) comparisons, undertaken in explicit water at different temperatures, show that the designed sequences are favorably placed against the chosen benchmarks as THB proteins potentially thermostable in the native folds. Folding simulation experiments with MD establish that the designed sequences are rapid in the folding of individual helices, but not in the evolution of tertiary structure; energetic cum topological frustrations remain but could be the artifacts of the starting conformations that were chosen in the THBs in the folding simulations. Overall, a practical high-throughput approach for de novo protein design has been developed that may have fruitful application for any type of tertiary structure.

Sampling realistic protein conformations using local structural bias

The prediction of protein structure from sequence remains a major unsolved problem in biology. The most successful protein structure prediction methods make use of a divide-and-conquer strategy to attack the problem: a conformational sampling method generates plausible candidate structures, which are subsequently accepted or rejected using an energy function. Conceptually, this often corresponds to separating local structural bias from the long-range interactions that stabilize the compact, native state. However, sampling protein conformations that are compatible with the local structural bias encoded in a given protein sequence is a long-standing open problem, especially in continuous space. We describe an elegant and mathematically rigorous method to do this, and show that it readily generates native-like protein conformations simply by enforcing compactness. Our results have far-reaching implications for protein structure prediction, determination, simulation, and design.

Protein structure prediction is one of the main unsolved problems in computational biology today. A common way to tackle the problem is to generate plausible protein conformations using a fairly inaccurate but fast method, and to evaluate the conformations using an accurate but slow method. The main bottleneck lies in the first step, that is, efficiently exploring protein conformational space. Currently, the best way to do this is to construct plausible structures by stringing together fragments from experimentally determined protein structures, a method called fragment assembly. Hamelryck, Kent, and Krogh present a new method that can efficiently generate protein conformations that are compatible with a given protein sequence. Unlike for existing methods, the generated conformations cover a continuous range and come with an associated probability. The method shows great promise for use in protein structure prediction, determination, simulation, and design.

Assessment of protein folding potentials with an evolutionary method

Many different protein folding potentials have been developed in the last decades, based upon knowledge of experimentally determined protein structures. Decoy-based techniques are frequently used to assess these force fields, but other methods can explore different features in the performance of the interaction schemes, thus helping in their evaluation. Here, we propose an evolutionary strategy to efficiently assess folding potentials. We apply it to three potentials with different characteristics, taken from the bibliography. A search for minimum energy protein topologies, treated as arrangements of rigid protein fragments, is performed. The method, applied to a set of helix bundle proteins, shows the different behavior of the studied potentials, providing a reasonably fast tool to evaluate their advantages and limitations.

Protein decoy sets for evaluating energy functions

Energy functions are crucial ingredients of protein tertiary structure prediction methods. Assessing the quality of energy functions is therefore of prime importance. It requires the elaboration of a standard evaluation scheme, whose key elements are: i). sets that contain the native and several non-native structures of proteins (decoys) in order to test whether the energy functions display the expected quality features and ii). measures to evaluate the reliability of energy functions. We present here a survey of the recent advances in these two related fields. In a first part, we analyze and review the large number of decoy sets that are available on the web, and we summarize the characteristics of a challenging decoy set. We then discuss how to define the quality of energy functions and review the measures related to it.

High-resolution prediction of protein helix positions and orientations

We have developed a new method for predicting helix positions in globular proteins that is intended primarily for comparative modeling and other applications where high precision is required. Unlike helix packing algorithms designed for ab initio folding, we assume that knowledge is available about the qualitative placement of all helices. However, even among homologous proteins, the corresponding helices can demonstrate substantial differences in positions and orientations, and for this reason, improperly positioned helices can contribute significantly to the overall backbone root-mean-square deviation (RMSD) of comparative models. A helix packing algorithm for use in comparative modeling must obtain high precision to be useful, and for this reason we utilize an all-atom protein force field (OPLS) and a Generalized Born continuum solvent model. To reduce the computational expense associated with using a detailed, physics-based energy function, we have developed new hierarchical and multiscale algorithms for sampling the helices and flanking loops. We validate the method using a test suite of 33 cases, which are drawn from a diverse set of high-resolution crystal structures. The helix positions are reproduced with an average backbone RMSD of 0.6 A, while the average backbone RMSD of the complete loop-helix-loop region (i.e., the helix with the surrounding loops, which are also repredicted) is 1.3 A.

Approximation of Protein Structure for Fast Similarity Measures

The structural comparison of two proteins comes up in many applications in structural biology where it is often necessary to find similarities in very large conformation sets. This work describes techniques to achieve significant speedup in the computation of structural similarity between two given conformations, at the expense of introducing a small error in the similarity measure. Furthermore, the proposed computational scheme allows for a tradeoff between speedup and error. This scheme exploits the fact that the Calpha representation of a protein conformation contains redundant information, due to the chain topology and limited compactness of proteins. This redundancy can be reduced by approximating subchains of a protein by their centers of mass, resulting in a smaller number of points to describe a conformation. A Haar wavelet analysis of random chains and proteins is used to justify this approximated representation. Similarity measures computed with this representation are highly correlated to the measures computed with the original Calpha representation. Therefore, they can be used in applications where small similarity errors can be tolerated or as fast filters in applications that require exact measures. Computational tests have been conducted on two applications, nearest neighbor search and automatic structural classification.

Evolutionary method for the assembly of rigid protein fragments

Genetic algorithms constitute a powerful optimization method that has already been used in the study of the protein folding problem. However, they often suffer from a lack of convergence in a reasonably short time for complex fitness functions. Here, we propose an evolutionary strategy that can reproducibly find structures close to the minimum of a potential function for a simplified protein model in an efficient way. The model reduces the number of degrees of freedom of the system by treating the protein structure as composed of rigid fragments. The search incorporates a double encoding procedure and a merging operation from subpopulations that evolve independently of one another, both contributing to the good performance of the full algorithm. We have tested it with protein structures of different degrees of complexity, and present our conclusions related to its possible application as an efficient tool for the analysis of folding potentials.

Application of a novel graph-theoretic folding degree index to the study of steroid-DB3 antibody binding affinity

A novel folding degree index, together with other macromolecular descriptors, is used to study steroid-DB3 antibody interactions. This index is based on graph spectral moments of a matrix representing the dihedral angles of a protein backbone. The causes influencing the different order of binding affinity of steroids to DB3 antibody are identified. It is shown that the changes in the chain compactness of the DB3 antibody with respect to its center of mass (radius of gyration) is compensated by a change in the folding degree index in the contrary sense. In fact, the increment in compactness of chain L and the lower increment in the folding degree index of chain H are able to explain the variations in affinity for DB3 of the steroids studied. Consequently, the highest binding affinities are reached by increasing the compactness of chain L in DB3 at the same time that producing the smallest increment in the folding degree of chain H. This study shows the possibilities of application for the graph-theoretic folding degree index in studying drug-protein interactions.

A novel approach to decoy set generation: designing a physical energy function having local minima with native structure characteristics

We suggest a new approach to the generation of candidate structures (decoys) for ab initio prediction of protein structures. Our method is based on random sampling of conformation space and subsequent local energy minimization. At the core of this approach lies the design of a novel type of energy function. This energy function has local minima with native structure characteristics and wide basins of attraction. The current work presents our motivation for deriving such an energy function and also tests the derived energy function. Our approach is novel in that it takes advantage of the inherently rough energy landscape of proteins, which is generally considered a major obstacle for protein structure prediction. When local minima have wide basins of attraction, the protein's conformation space can be greatly reduced by the convergence of large regions of the space into single points, namely the local minima corresponding to these funnels. We have implemented this concept by an iterative process. The potential is first used to generate decoy sets and then we study these sets of decoys to guide further development of the potential. A key feature of our potential is the use of cooperative multi-body interactions that mimic the role of the entropic and solvent contributions to the free energy. The validity and value of our approach is demonstrated by applying it to 14 diverse, small proteins. We show that, for these proteins, the size of conformation space is considerably reduced by the new energy function. In fact, the reduction is so substantial as to allow efficient conformational sampling. As a result we are able to find a significant number of near-native conformations in random searches performed with limited computational resources.

Protein decoy assembly using short fragments under geometric constraints

A small set of protein fragments can represent adequately all known local protein structure. This set of fragments, along with a construction scheme that assembles these fragments into structures, defines a discrete (relatively small) conformation space, which approximates protein structures accurately. We generate protein decoys by sampling geometrically valid structures from this conformation space, biased by the secondary structure prediction for the protein. Unlike other methods, secondary structure prediction is the only protein-specific information used for generating the decoys. Nevertheless, these decoys are qualitatively similar to those found by others. The method works well for all-alpha proteins, and shows promising results for alpha and beta proteins.

Packing helices in proteins by global optimization of a potential energy function

An efficient method has been developed for packing alpha-helices in proteins. It treats alpha-helices as rigid bodies and uses a simplified Lennard-Jones potential with Miyazawa-Jernigan contact-energy parameters to describe the interactions between the alpha-helical elements in this coarse-grained system. Global conformational searches to generate packing arrangements rapidly are carried out with a Monte Carlo-with-minimization type of approach. The results for 42 proteins show that the approach reproduces native-like folds of alpha-helical proteins as low-energy local minima of this highly simplified potential function.

Designability of alpha-helical proteins

A typical protein structure is a compact packing of connected alpha-helices and/or beta-strands. We have developed a method for generating the ensemble of compact structures a given set of helices and strands can form. The method is tested on structures composed of four alpha-helices connected by short turns. All such natural four-helix bundles that are connected by short turns seen in nature are reproduced to closer than 3.6 A per residue within the ensemble. Because structures with no natural counterpart may be targets for ab initio structure design, the designability of each structure in the ensemble-defined as the number of sequences with that structure as their lowest-energy state-is evaluated using a hydrophobic energy. For the case of four alpha-helices, a small set of highly designable structures emerges, most of which have an analog among the known four-helix fold families; however, several packings and topologies with no analogs in protein database are identified.