|Title:||NP-completeness of the direct energy barrier problem without pseudoknots|
Department of Computer Science, University of British Columbia
This talk will describe recent work with Chris Thachuk as well as Jan Manuch and Ladislav Stacho at SFU.
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in design of programmed molecular systems. Current heuristics are not guaranteed to find the exact energy barrier, raising the question whether the energy barrier can be calculated efficiently. In this paper, we study the computational complexity of a simple formulation of the energy barrier problem, in which each base pair contributes an energy of 1 and only base pairs in the initial and final structures may be used on a folding pathway from initial to final structure. We show that this problem is NP-complete.