Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications (Q1319879): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of protein folding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5812175 / rank | |||
Normal rank | |||
Latest revision as of 14:42, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications |
scientific article |
Statements
Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications (English)
0 references
11 July 1994
0 references
protein folding problem
0 references
NP-completeness
0 references
NP-hardness
0 references
lattice model
0 references
lowest free energy conformation
0 references
global free energy minimum
0 references
native functional conformation
0 references
