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

DOI10.1007/S11047-010-9239-4zbMath1257.68073OpenAlexW2093152025MaRDI QIDQ537858

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

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)

Related Items (2)

On Low Energy Barrier Folding Pathways for Nucleic Acid Sequences ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: NP-completeness of the energy barrier problem without pseudoknots and temporary arcs