首页> 外文期刊>Proteins: Structure, Function, and Genetics >Exploring zipping and assembly as a protein folding principle.
【24h】

Exploring zipping and assembly as a protein folding principle.

机译:探索作为蛋白质折叠原理的拉链和组装。

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

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. Proteins 2007. (c) 2006 Wiley-Liss, Inc.
机译:已经提出蛋白质通过称为“拉链和组装”(Z&A)的过程折叠。压缩是指链中局部子结构的增长,组装是指已经形成的零件聚集在一起。我们的兴趣在于,Z&A是否是一种可以有效地将大多数序列空间折叠到全局最小值的通用方法。使用HP模型,我们可以通过列举完整的构象和序列空间来解决这个问题。我们发现Z&A即使在整个序列空间中的大多数序列中仅搜索构象空间的一小部分,也达到了全局能量最小本征态。我们发现Z&A(一种基于机制的搜索)在我们的测试中比副本交换搜索方法更有效。对于具有以下条件的链,折叠效率会提高:(a)较小的闭环步骤,与Plaxco等人的观察一致。 1998; 277; 985-994中,折叠速率与接触顺序相关,(b)每条链的成核位点既不要太少也不能太多,以及(c)在折叠过程中不会太早发生的组装步骤。我们发现效率随链长而增加,尽管我们的链长范围有限。我们相信这些见解可能对开发更快的蛋白质构象搜索算法很有用。蛋白质2007。(c)2006 Wiley-Liss,Inc.。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号