格上的蛋白质折叠:一种整数规划方法

The Sharpest Cut Pub Date : 2002-09-24 DOI:10.2139/SSRN.2154543

V. Chandru, M. Rao, G. Swaminathan

{"title":"格上的蛋白质折叠:一种整数规划方法","authors":"V. Chandru, M. Rao, G. Swaminathan","doi":"10.2139/SSRN.2154543","DOIUrl":null,"url":null,"abstract":"In this paper, we initiate the study of the protein folding problem from an integer linear programming perspective. The particular variant of protein folding that we examine is known as the hydrophobic-hydrophilic (HP) model of protein folding on the integer lattice. This problem is known to be NP-hard and also maxSNP-hard. We examine various alternate formulations for the planar version of this problem and present some preliminary computational results. Hopefully, this sets the stage for a polyhedral combinatorics assault on this important problem.","PeriodicalId":416196,"journal":{"name":"The Sharpest Cut","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Protein Folding on Lattices: An Integer Programming Approach\",\"authors\":\"V. Chandru, M. Rao, G. Swaminathan\",\"doi\":\"10.2139/SSRN.2154543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we initiate the study of the protein folding problem from an integer linear programming perspective. The particular variant of protein folding that we examine is known as the hydrophobic-hydrophilic (HP) model of protein folding on the integer lattice. This problem is known to be NP-hard and also maxSNP-hard. We examine various alternate formulations for the planar version of this problem and present some preliminary computational results. Hopefully, this sets the stage for a polyhedral combinatorics assault on this important problem.\",\"PeriodicalId\":416196,\"journal\":{\"name\":\"The Sharpest Cut\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sharpest Cut\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/SSRN.2154543\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sharpest Cut","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/SSRN.2154543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文从整数线性规划的角度出发，研究了蛋白质折叠问题。我们研究的蛋白质折叠的特殊变体被称为蛋白质在整数晶格上折叠的疏水-亲水性(HP)模型。这个问题被称为NP-hard和maxSNP-hard。我们研究了这个问题的平面版本的各种替代公式，并提出了一些初步的计算结果。希望这能为多面体组合学对这个重要问题的研究奠定基础。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Protein Folding on Lattices: An Integer Programming Approach

In this paper, we initiate the study of the protein folding problem from an integer linear programming perspective. The particular variant of protein folding that we examine is known as the hydrophobic-hydrophilic (HP) model of protein folding on the integer lattice. This problem is known to be NP-hard and also maxSNP-hard. We examine various alternate formulations for the planar version of this problem and present some preliminary computational results. Hopefully, this sets the stage for a polyhedral combinatorics assault on this important problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The Sharpest Cut

自引率

0.00%

发文量

期刊最新文献

Protein Folding on Lattices: An Integer Programming Approach Relaxing Perfectness: Which Graphs Are "Almost" Perfect? On the Expansion of Graphs of 0/1-Polytopes Typical and Extremal Linear Programs Graph Drawing: Exact Optimization Helps!