Protein Folding on Lattices: An Integer Programming Approach

Chandru, V and Rao, M R and Swaminathan, G (2012) Protein Folding on Lattices: An Integer Programming Approach. Working Paper. SSRN. (Unpublished)

Full text not available from this repository. (Request a copy)

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.

Affiliation: Indian School of Business
ISB Creators:
ISB CreatorsORCiD
Rao, M RUNSPECIFIED
Item Type: Monograph (Working Paper)
Additional Information: The research article was published by the author with the affiliation of Indian Institute of Management Bangalore.
Uncontrolled Keywords: Protein Folding, Lattices, Integer Programming polyhedral combinatorics
Subjects: Applied Statistics and Computing
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 15:57
Last Modified: 03 Apr 2019 15:57
URI: http://eprints.exchange.isb.edu/id/eprint/757
Publisher URL: http://dx.doi.org/10.2139/ssrn.2154543
Related URLs:

Actions (login required)

View Item View Item
Statistics for DESI ePrint 757 Statistics for this ePrint Item