Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition
The prediction of RNA secondary structure including pseudoknots remains a challenge due to the intractable computation of the sequence conformation from intriguing nucleotide interactions. Optimal algorithms often assume a restricted class for the predicted RNA structures and yet still require a high-degree polynomial time complexity, which is too expensive to use. Heuristic methods may yield time-efficient algorithms but they do not guarantee optimality of the predicted structure. This paper introduces a new and efficient algorithm for the prediction of RNA structure with pseudoknots for which the structure is not restricted. Novel prediction techniques are developed based on graph tree decomposition. In particular, stem overlapping relationships are defined with a graph, in which a specialized maximum independent set (IS) corresponds to the desired optimal structure. Such a graph is tree decomposable; dynamic programming over a tree decomposition of the graph leads to an efficient algorithm. The new algorithm is evaluated on a large number of RNA sequence sets taken from diverse resources. It demonstrates overall sensitivity and specificity that outperforms or is comparable with those of previous optimal and heuristic algorithms yet it requires significantly less time than other optimal algorithms.
KeywordsTree Decomposition Hepatitis Delta Virus Tree Width Thermodynamic Energy Dynamic Programming Table
Unable to display preview. Download preview PDF.
- 2.Bodlaender, H.L.: Classes of graphs with bounded tree-width. Tech. Rep. RUU-CS-86-22, Dept. of Computer Science, Utrecht University, the Netherlands (1986)Google Scholar
- 3.Bodlaender, H.L.: Dynamic programming algorithms on graphs with bounded tree-width. In: Lepistö, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105–119. Springer, Heidelberg (1988)Google Scholar
- 10.Hicks, I.V., Koster, A.M.C.A., Kolotoglu, E.: Branch and tree decomposition techniques for discrete optimization. In: Tutorials in Operations Research: INFORMS – New Orleans 2005 (2005)Google Scholar
- 20.Serra, M.J., Turner, D.H., Freier, S.M.: Predicting thermodynamic properties of RNA. Meth. Enzymol. 259, 243–261 (1995)Google Scholar
- 21.Song, Y., Liu, C., Malmberg, R.L., Pan, F., Cai, L.: Tree decomposition based fast search of RNA structures including pseudoknots in genomes. In: Proc. Comput. System Bioinformatics Conf. CSB 2005, pp. 223–234. IEEE Computer Society, Los Alamitos (2005)Google Scholar