Table of Contents
Is protein folding NP problem?
Protein folding problem is a Non deterministic Polynomial hard problem. Proteins are of different types, whereas each protein plays an important role in the living cells. Every protein has a unique structure and function. The unique structure is formed by folding of proteins from sequence of amino acids.
Why is it difficult to solve a protein folding problem?
In part, it is because protein folding is a kinetics driven process, and not one that necessarily reaches minimum free energy. As such, one has to model the environment quite well and this is harder than just looking at interactions among the residues along the sequence.
Is protein folding problem really a NP complete one first investigations?
To find the 3D conformation of a protein knowing its amino acid sequence, bioinformaticians use various models of different resolutions and artificial intelligence tools, as the protein folding prediction problem is a NP complete one.
How does protein folding work?
Protein folding is a process by which a polypeptide chain folds to become a biologically active protein in its native 3D structure. The amino acids in the chain eventually interact with each other to form a well-defined, folded protein. The amino acid sequence of a protein determines its 3D structure.
What does solving protein folding mean?
Protein folding is the physical process by which a protein chain is translated to its native three-dimensional structure, typically a “folded” conformation by which the protein becomes biologically functional.
Why correct protein folding is important in the structure of protein?
Protein folding occurs in a cellular compartment called the endoplasmic reticulum. This is a vital cellular process because proteins must be correctly folded into specific, three-dimensional shapes in order to function correctly. Unfolded or misfolded proteins contribute to the pathology of many diseases.
Are NP hard problems NP-complete?
NP-Hard problems are as hard as NP-Complete problems. NP-Hard Problem need not be in NP class. A problem is NP-Complete if it is a part of both NP and NP-Hard Problem. A non-deterministic Turing machine can solve NP-Complete problem in polynomial time.