Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs

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.

[1]  A. Condon,et al.  Improved free energy parameters for RNA pseudoknotted secondary structure prediction. , 2010, RNA.

[2]  Robert Giegerich,et al.  A discipline of dynamic programming over sequence data , 2004, Sci. Comput. Program..

[3]  Michael Zuker,et al.  Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information , 1981, Nucleic Acids Res..

[4]  Ye Ding,et al.  Structure clustering features on the Sfold Web server , 2005, Bioinform..

[5]  Robert Giegerich,et al.  Explaining and Controlling Ambiguity in Dynamic Programming , 2000, CPM.

[6]  Walter Fontana,et al.  Fast folding and comparison of RNA secondary structures , 1994 .

[7]  P. Schuster,et al.  Complete suboptimal folding of RNA and the stability of secondary structures. , 1999, Biopolymers.

[8]  Tatsuya Akutsu,et al.  Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots , 2000, Discret. Appl. Math..

[9]  Dan Gusfield,et al.  A simple, practical and complete O-time Algorithm for RNA folding using the Four-Russians Speedup , 2010, Algorithms for Molecular Biology.

[10]  J. Herold,et al.  An 'elaborated' pseudoknot is required for high frequency frameshifting during translation of HCV 229E polymerase mRNA. , 1993, Nucleic acids research.

[11]  Robert Giegerich,et al.  Semantics and Ambiguity of Stochastic RNA Family Models , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[12]  H. Hoos,et al.  HotKnots: heuristic prediction of RNA secondary structures including pseudoknots. , 2005, RNA.

[13]  David H Mathews,et al.  Prediction of RNA secondary structure by free energy minimization. , 2006, Current opinion in structural biology.

[14]  I. Tinoco,et al.  Characterization of a "kissing" hairpin complex derived from the human immunodeficiency virus genome. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Einar Andreas Rødland.  Pseudoknots in RNA Secondary Structures: Representation, Enumeration, and Prevalence , 2006, J. Comput. Biol..

[16]  D. Turner,et al.  Incorporating chemical modification constraints into a dynamic programming algorithm for prediction of RNA secondary structure. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Christian N. S. Pedersen,et al.  RNA Pseudoknot Prediction in Energy-Based Models , 2000, J. Comput. Biol..

[18]  Hosna Jabbari,et al.  Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges , 2009, Theor. Comput. Sci..

[19]  C. Pleij,et al.  Kissing of the two predominant hairpin loops in the coxsackie B virus 3' untranslated region is the essential structural feature of the origin of replication required for negative-strand RNA synthesis , 1997, Journal of virology.

[20]  Ignacio Tinoco,et al.  Unusual mechanical stability of a minimal RNA kissing complex , 2006, Proceedings of the National Academy of Sciences.

[21]  Shaojie Zhang,et al.  PMFastR: A New Approach to Multiple RNA Structure Alignment , 2009, WABI.

[22]  Robert Giegerich,et al.  Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics , 2004, BMC Bioinformatics.

[23]  Dan Gusfield,et al.  A simple, practical and complete O(n³/log n)-time algorithm for RNA folding using the four-Russians speedup , 2009, WABI 2009.

[24]  F. H. D. van Batenburg,et al.  PseudoBase: structural information on RNA pseudoknots , 2001, Nucleic Acids Res..

[25]  L. Gold,et al.  RNA pseudoknots that inhibit human immunodeficiency virus type 1 reverse transcriptase. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[26]  E Rivas,et al.  A dynamic programming algorithm for RNA structure prediction including pseudoknots. , 1998, Journal of molecular biology.

[27]  Hosna Jabbari,et al.  An O(n5) Algorithm for MFE Prediction of Kissing Hairpins and 4-Chains in Nucleic Acids , 2009, J. Comput. Biol..

[28]  Kevin P. Murphy,et al.  Efficient parameter estimation for RNA secondary structure prediction , 2007, ISMB/ECCB.