Chandru, Vijay ; Rao, M. Rammohan ; Swaminathan, Ganesh (2002) Protein Folding on Lattices: An Integer Programming Approach SSRN Electronic Journal . ISSN 1556-5068
Full text not available from this repository.
Official URL: http://doi.org/10.2139/ssrn.2154543
Related URL: http://dx.doi.org/10.2139/ssrn.2154543
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Inc |
| ID Code: | 132588 |
| Deposited On: | 20 Dec 2022 06:48 |
| Last Modified: | 20 Dec 2022 06:48 |
Repository Staff Only: item control page
