Protein folding on lattices: an integer programming approach

Authors

Vijay Chandru
Mendu Rammohan Rao
Ganesh Swaminathan

Document Type

Working Paper

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.

Publication Date

1-4-2002

Publisher

Indian Institute of Management Bangalore

Pagination

15p.

Recommended Citation

Chandru, Vijay; Rao, Mendu Rammohan; and Swaminathan, Ganesh, "Protein folding on lattices: an integer programming approach" (2002). Working Papers. 204.
https://research.iimb.ac.in/work_papers/204

Relation

IIMB Working Paper-199