%0 Journal Article
%J Journal of Computational Biology
%D 1997
%T Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model
%A Agarwala,Richa
%A Batzoglou,Serafim
%A DančíK,Vlado
%A Decatur,Scott E.
%A Hannenhalli, Sridhar
%A Farach,Martin
%A Muthukrishnan,S.
%A Skiena,Steven
%X We consider the problem of determining the three-dimensional folding of a protein given its one-dimensional amino acid sequence. We use the HP model for protein folding proposed by Dill (1985), which models protein as a chain of amino acid residues that are either hydrophobic or polar, and hydrophobic interactions are the dominant initial driving force for the protein folding. Hart and Istrail (1996a) gave approximation algorithms for folding proteins on the cubic lattice under the HP model. In this paper, we examine the choice of a lattice by considering its algorithmic and geometric implications and argue that the triangular lattice is a more reasonable choice. We present a set of folding rules for a triangular lattice and analyze the approximation ratio they achieve. In addition, we introduce a generalization of the HP model to account for residues having different levels of hydrophobicity. After describing the biological foundation for this generalization, we show that in the new model we are able to achieve similar constant factor approximation guarantees on the triangular lattice as were achieved in the standard HP model. While the structures derived from our folding rules are probably still far from biological reality, we hope that having a set of folding rules with different properties will yield more interesting folds when combined.
%B Journal of Computational Biology
%V 4
%P 275 - 296
%8 1997/01//
%@ 1066-5277, 1557-8666
%G eng
%U http://www.liebertonline.com/doi/abs/10.1089/cmb.1997.4.275
%N 3
%R 10.1089/cmb.1997.4.275