Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete

Bonnie A Berger, T. L. (1998). Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete.

Type

Unclassified

Intellectual base

Unclassified

Year

1998

DOI

10.1089/cmb.1998.5.27

Link

https://doi.org/10.1089/cmb.1998.5.27

Cited by

1 citation across 1 artifact.

Domain-specific

• Computational complexity theory
  • … transfers from A canonical instance directly demonstrates that problem, encoding, computational model, resource measure, asymptotic bound, and reduction notion are all fixed before classification. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:c4956d122bac · see in the full table