NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
From MaRDI portal
Publication:3654673
DOI10.1007/978-3-642-10604-0_11zbMath1273.68151OpenAlexW1828328674MaRDI QIDQ3654673
Anne Condon, Ladislav Stacho, Chris Thachuk, Ján Maňuch
Publication date: 7 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10604-0_11
Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
