首页> 外文会议> >CONSTRAINT-BASED HYDROPHOBIC CORE CONSTRUCTION FOR PROTEIN STRUCTURE PREDICTION IN THE FACE-CENTERED-CUBIC LATTICE
【24h】

CONSTRAINT-BASED HYDROPHOBIC CORE CONSTRUCTION FOR PROTEIN STRUCTURE PREDICTION IN THE FACE-CENTERED-CUBIC LATTICE

机译:基于约束的疏水中心在面心立方晶格中预测蛋白质结构

获取原文
获取原文并翻译 | 示例

摘要

We present an algorithm for exact protein structure prediction in the FCC-HP-model. This model is a lattice protein model on the face-centered-cubic lattice that models the main force of protein folding, namely the hydrophobic force. The structure prediction for this model can be based on the construction of hydrophobic cores. The main focus of the paper is on an algorithm for constructing maximally and submaximally compact hydrophobic cores of a given size. This algorithm treats core construction as a constraint satisfaction problem (CSP), and the paper describes its constraint model. The algorithm employs symmetry excluding constraint-based search and relies heavily on good upper bounds on the number of contacts. Here, we use and strengthen upper bounds presented earlier. The resulting structure prediction algorithm (including previous work) handles sequences of sizes in the range of real proteins fast, i.e. we predict a first structure often within a few minutes. The algorithm is the first exact one for the FCC, besides full enumeration which is impracticable for chain lengths greater than about 15. We tested the algorithm succesfully up to sequence length of 160, which is far beyond the capabilities even of previous heuristic approaches.
机译:我们提出了一种在FCC-HP模型中精确蛋白质结构预测的算法。该模型是面心立方晶格上的晶格蛋白质模型,该模型模拟了蛋白质折叠的主要力,即疏水力。该模型的结构预测可以基于疏水核的构造。本文的主要重点是一种用于构造给定尺寸的最大和次最大压缩疏水核的算法。该算法将核心构造视为约束满足问题(CSP),并描述了其约束模型。该算法采用了不包括基于约束的搜索在内的对称性,并且在很大程度上依赖于联系人数量的良好上限。在这里,我们使用并加强了前面介绍的上限。产生的结构预测算法(包括先前的工作)可以快速处理真实蛋白质范围内的大小序列,即我们通常在几分钟内即可预测出第一个结构。该算法是针对FCC的第一个精确算法,除了完整的枚举对于大于约15的链长是不可行的。我们成功地测试了算法,直到序列长度为160,这甚至超出了以前的启发式方法的能力。

著录项

  • 来源
    《》|2002年|p.661-672|共12页
  • 会议地点 Kauai HI(US);Kauai HI(US)
  • 作者

    SEBASTIAN WILL;

  • 作者单位

    Institut fuer Informatik, Ludwig-Maximilians-Universitaet Muenchen, Oettingenstraβe 67, D-80538 Muenchen, Germany;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 Q8;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号