arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1103.1503cs.DS
收藏

蛋白质设计中侧链位置的精确算法

An Exact Algorithm for Side-Chain Placement in Protein Design

Stefan Canzar, Nora C. Toussaint, Gunnar W. Klau

摘要:

计算蛋白质设计的目的是在给定的蛋白质骨架结构上构建新的或改进的功能,并且在制药和生物技术工业中具有重要的应用。潜在的组合侧链布局问题包括为每个残基位置选择侧链布局,使得所得的总能量最小。侧链的选择也决定了该位置的氨基酸。在同源建模的背景下,已经提出了许多算法来解决这个NP难问题,但是,当面对大型蛋白质设计实例时,这些算法会达到其极限。在本文中,我们提出了一个新的精确的方法,侧链的位置问题,即使是大的实例大小,因为它们出现在蛋白质设计工作得很好。我们的主要贡献是一个专门的分支定界算法,结合紧密的上限和下限,从一个新的拉格朗日松弛方法的侧链位置。我们的实验结果表明,我们的方法优于其他最先进的精确方法,并使其有可能以最佳方式解决大型蛋白质设计实例。

英文摘要:

Computational protein design aims at constructing novel or improved functions on the structure of a given protein backbone and has important applications in the pharmaceutical and biotechnical industry. The underlying combinatorial side-chain placement problem consists of choosing a side-chain placement for each residue position such that the resulting overall energy is minimum. The choice of the side-chain then also determines the amino acid for this position. Many algorithms for this NP-hard problem have been proposed in the context of homology modeling, which, however, reach their limits when faced with large protein design instances. In this paper, we propose a new exact method for the side-chain placement problem that works well even for large instance sizes as they appear in protein design. Our main contribution is a dedicated branch-and-bound algorithm that combines tight upper and lower bounds resulting from a novel Lagrangian relaxation approach for side-chain placement. Our experimental results show that our method outperforms alternative state-of-the art exact approaches and makes it possible to optimally solve large protein design instances routinely.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑