Hydrophobic-polar protein folding model

The hydrophobic-polar protein folding model is a highly simplified model for examining protein folds in space. First proposed by Dill in 1985, it is motivated by the observation that hydrophobic interactions between amino acid residues are the driving force for proteins folding into their native state.^[1] All amino acid types are classified as either hydrophobic (H) or polar (P), and the folding of a protein sequence is defined as a self-avoiding walk in a 2D or 3D lattice. The HP model imitates the hydrophobic effect by assigning a negative (favorable) weight to interactions between adjacent, non-covalently bound H residues. Proteins that have minimum energy are assumed to be in their native state.

Additional recommended knowledge

What is the Correct Way to Check Repeatability in Balances?

Daily Sensitivity Test

Correct Test Weight Handling Guide: 12 Practical Tips

The HP model can be expressed in both two and three dimensions, generally with square lattices, although triangular lattices have been used as well.

Randomized search algorithms are often used to tackle the HP folding problem. This includes stochastic, evolutionary algorithms like the Monte Carlo method, genetic algorithms, and ant colony optimization. While no method has been able to calculate the experimentally determined minimum energetic state for long protein sequences, the most advanced methods today are able to come close.^[2][3]

Even though the HP model abstracts away many of the details of protein folding, it is still an NP-hard problem on both 2D and 3D lattices.^[4]

See also

• Protein structure prediction
• Lattice proteins

References

1. ^ Dill K.A. (1985). "Theory for the folding and stability of globular proteins". Biochemistry 24 (1501). Entrez PubMed 3986190.
2. ^ Bui T.N., Sundarraj G. (2005). "An efficient genetic algorithm for predicting protein tertiary structures in the 2D HP model". GECCO'05.
3. ^ Shmygelska A., Hoos H.H. (2003). "An improved ant colony optimisation algorithm for the 2D HP protein folding problem". Proc. of the 16th Canadian Conference on Artificial Intelligence (AI'2003) 2671: 400-417.
4. ^ Crescenzi P., Goldman D., Papadimitriou C., Piccolboni A., Yannakakis M. (1998). "On the complexity of protein folding". Macromolecules 5 (1): 27-40. Entrez PubMed 9773342.