NP-completeness of the energy barrier problem without pseudoknots and temporary arcs
DOI10.1007/S11047-010-9239-4zbMATH Open1257.68073OpenAlexW2093152025MaRDI QIDQ537858FDOQ537858
Authors: Ján Maňuch, Chris Thachuk, Ladislav Stacho, Anne Condon 
Publication date: 23 May 2011
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-010-9239-4
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
Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
Cited In (6)
- On a barrier height problem for RNA branching
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
- On low energy barrier folding pathways for nucleic acid sequences
- Predicting minimum free energy structures of multi-stranded nucleic acid complexes is APX-hard
- Title not available (Why is that?)
- An IP algorithm for RNA folding trajectories
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)
