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

Ján Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon. NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing, 10(1):391-405, 2011. [doi]

@article{ManuchTSC11,
  title = {NP-completeness of the energy barrier problem without pseudoknots and temporary arcs},
  author = {Ján Manuch and Chris Thachuk and Ladislav Stacho and Anne Condon},
  year = {2011},
  doi = {10.1007/s11047-010-9239-4},
  url = {http://dx.doi.org/10.1007/s11047-010-9239-4},
  tags = {completeness},
  researchr = {https://researchr.org/publication/ManuchTSC11},
  cites = {0},
  citedby = {0},
  journal = {Natural Computing},
  volume = {10},
  number = {1},
  pages = {391-405},
}