Theoremresearch
NP-hardness of pseudoknot prediction
Also called Pseudoknot prediction is NP-hard.
Predicting the minimum free energy structure with arbitrary pseudoknots is NP-hard (Lyngso and Pedersen, 2000).
Predicting the minimum free energy structure with arbitrary pseudoknots is NP-hard (Lyngso and Pedersen, 2000).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KS4RN5 Edit this page History Report an error