{"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}
引用次数: 2
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.