In this paper, the protein folding problem under the HP model on the cubic lattice is shown to be NP-complete. This means that the protein folding problem belongs to a large set of problems that are believed to be computationally intractable.
Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model
People also ask
Is protein folding NP complete?
What is the hydrophobic polar HP model?
What is the hydrophobic effect in protein folding?
How do hydrophilic and hydrophobic amino acids affect the structure of a protein?
The HP model abstracts the hydrophobic interaction in protein folding by labeling the amino acids as hydrophobic (H for nonpolar) or hydrophilic (P for polar).
In this paper, the protein folding prob- lem under the HP model on the cubic lattice is shown to be NP-complete. This means that the protein fold- ing problem ...
In this paper, the protein folding prob- lem under the HP model on the cubic lattice is shown to be NP-complete. This means that the protein fold- ing problem ...
Theprotein folding problem under the HP model on the cubic lattice is shown to be NP-complete, which means that the protein folding problem belongs to a ...
models. The discovery that protein folding in the HP model is NP-complete lends further importance to the study of approximation algorithms for protein folding.
The protein folding problem in the HP model on the 2D square lattice is NP -hard [3] as is the problem on the 3 D square lattice [2 ] . O n the positive side, H ...
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 square lattices.
Jan 23, 2020 · The goal of the protein folding problem in the HP model is to find the conformation C that its energy function value is minimum. For example, ...