NP-completeness of the energy barrier problem without pseudoknots and temporary arcs

DOI10.1007/S11047-010-9239-4zbMATH Open1257.68073OpenAlexW2093152025MaRDI QIDQ537858FDOQ537858

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
• NP-completeness: a retrospective

zbMATH Keywords

NP-completenessnucleic acidsenergy barrierfolding pathways

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
• Barrier heights between ground states in a model of RNA secondary structure
• DNA Computing
• DNA Computing

Cited In (5)

• On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences
• Title not available (Why is that?)
• On a barrier height problem for RNA branching
• NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
• Title not available (Why is that?)

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)