Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs

Theis C, Janssen S, Giegerich R. Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs. In: Moulton V, Singh M, eds. Algorithms in Bioinformatics. 10th international workshop (WABI 2010), proceedings. Lecture Notes in Bioinformatics. Vol 6293. Berlin: Springer; 2010: 52-64.We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin motif from an overlay of two simple canonical pseudoknots. The difficulty is that the overlay does not satisfy Bellman's Principle of Optimality, and the kissing hairpin cannot simply be built from optimal pseudoknots. Our strategies have time/space complexities of O(n^4)/O(n^2), O(n^4)/O(n^3), and O(n^5)/O(n^2). All strategies have been implemented in the program pKiss and were evaluated against known structures. Surprisingly, our simplest strategy performs best. As it has the same complexity as the previous algorithm for simple pseudoknots, the overlay idea opens a way to construct a variety of practically useful algorithms for pseudoknots of higher topological complexity within O(n^4) time and O(n^2) space