NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
From MaRDI portal
(Redirected from Publication:537858)
Recommendations
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
- NP-hard problems naturally arising in knot theory
- A Natural NP-Complete Problem with a Nontrivial Lower Bound
- Trahtenbrot-Zykov problem and NP-completeness
- NP-completeness of some edge-disjoint paths problems
- scientific article
- scientific article; zbMATH DE number 2012168
- Consistency of circuit evaluation, extended resolution and total NP search problems
- scientific article; zbMATH DE number 1583885
- NP-completeness: a retrospective
Cites work
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Barrier heights between ground states in a model of RNA secondary structure
- DNA Computing
- DNA Computing
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Cited in
(6)- An IP algorithm for RNA folding trajectories
- On low energy barrier folding pathways for nucleic acid sequences
- scientific article; zbMATH DE number 426425 (Why is no real title available?)
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
- On a barrier height problem for RNA branching
- Predicting minimum free energy structures of multi-stranded nucleic acid complexes is APX-hard
This page was built for publication: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537858)
