Dataset Information

Iterative assembly of helical proteins by optimal hydrophobic packing.

ABSTRACT: 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.

SUBMITTER: Wu GA

PROVIDER: S-EPMC2629734 | biostudies-literature | 2008 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Iterative assembly of helical proteins by optimal hydrophobic packing.

Wu G Albert GA Coutsias Evangelos A EA Dill Ken A KA

Structure (London, England : 1993) 20080801 8

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 inter ...[more]

PMID: 18682227

Similar Datasets

Project description:This article presents the results of a detailed analysis of helix-helix interactions in membrane and soluble proteins. A data set of interacting pairs of helices in membrane proteins of known structure was constructed and a structure alignment algorithm was used to identify pairs of helices in soluble proteins that superimpose well with pairs of helices in the membrane-protein data set. Most helix pairs in membrane proteins are found to have a significant number of structural homologs in soluble proteins, although in some cases, primarily involving irregular helices, no close homologs exist. An analysis of geometric relationships between interacting helices in the two sets of proteins identifies some differences in the distributions of helix length, interfacial area, packing angle, and distance between the polypeptide backbones. However, a subset of soluble-protein helix pairs that are close structural homologs to membrane-protein helix pairs exhibits distributions that mirror those observed in membrane proteins. The larger average interface size and smaller distance of closest approach seen for helices in membrane proteins appears due in part to a relative enrichment of alanines and glycines, particularly as components of the AxxxA and GxxxG motifs. It is argued that membrane helices are not on average more tightly packed than helices in soluble proteins; they are simply able to approach each other more closely. This enables them to interact over longer distances, which may in turn facilitate their remaining in contact over much of the width of the lipid bilayer. The close structural similarity seen between some pairs of helices in membrane and soluble proteins suggests that packing patterns observed in soluble proteins may be useful in the modeling of membrane proteins. Moreover, there do not appear to be fundamental differences between the magnitude of the forces that drive helix packing in membrane and soluble proteins, suggesting that strategies to make membrane proteins more soluble by mutating surface residues are likely to encounter success, at least in some cases.

Dataset Information

Iterative assembly of helical proteins by optimal hydrophobic packing.

Publications

Iterative assembly of helical proteins by optimal hydrophobic packing.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets