Abstract
It has been proposed that proteins fold by a process called "Zipping and Assembly" (Z&A). Zipping refers to the growth of local substructures within the chain, and assembly refers to the coming together of already-formed pieces. Our interest here is in whether Z&A is a general method that can fold most of sequence space, to global minima, efficiently. Using the HP model, we can address this question by enumerating full conformation and sequence spaces. We find that Z&A reaches the global energy minimum native states, even though it searches only a very small fraction of conformational space, for most sequences in the full sequence space. We find that Z&A, a mechanism-based search, is more efficient in our tests than the replica exchange search method. Folding efficiency is increased for chains having: (a) small loop-closure steps, consistent with observations by Plaxco et al. 1998;277;985-994 that folding rates correlate with contact order, (b) neither too few nor too many nucleation sites per chain, and (c) assembly steps that do not occur too early in the folding process. We find that the efficiency increases with chain length, although our range of chain lengths is limited. We believe these insights may be useful for developing faster protein conformational search algorithms.
Original language | English |
---|---|
Pages (from-to) | 877-888 |
Number of pages | 12 |
Journal | Proteins: Structure, Function and Bioinformatics |
Volume | 66 |
Issue number | 4 |
DOIs | |
State | Published - Mar 2007 |
Keywords
- Effective contact order
- Fast conformational search algorithm
- Folding mechanism
- Folding search principle
- HP lattice model
- Topologically local
- Topology-dependent folding rates