12. Protein Folding on Lattices: An Integer Programming Approach
Vijay Chandru, M. R. Rao, Ganesh Jawahar Swaminathan · Society for Industrial and Applied Mathematics eBooks · 2004
In this chapter, 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. We hope that this will set the stage for a polyhedral combinatorics assault on this important problem.