13th IEEE International Conference on BioInformatics and BioEngineering (2003)
Mar. 10, 2003 to Mar. 12, 2003
Fariza Tahi , Université d' Evry-Val d' Essonne
Stefan Engelen , Université d' Evry-Val d' Essonne
Mireille Régnier , INRIA Rocquencourt
<p>Many important RNA molecules contain pseudoknots, which are generally excluded by the definition of the secondary structure, mainly for computational reasons. Still, most existing algorithms for secondary structure prediction are not satisfactory in results and complexities, even when pseudoknots are not allowed. We present an algorithm, called P-DCFold, for the prediction of RNA secondary structures including all kinds of pseudoknots. It is based on the comparative approach. The helices are searched recursively, from more "likely" to less "likely", using the "Divide and Conquer" approach. This approach, which allows to limit the amount of searching, is possible when only non-interleaved helices are searched for. The pseudoknots are therefore searched in several steps, each helix of the pseudoknot being selected in a different step.</p> <p>P-DCFold has been applied to tmRNA and RnaseP sequences. In less than two seconds, their respective secondary structures, including their pseudoknots, have been recovered very efficiently.</p>
F. Tahi, M. Régnier and S. Engelen, "A Fast Algorithm for RNA Secondary Structure Prediction Including Pseudoknots," 13th IEEE International Conference on BioInformatics and BioEngineering(BIBE), Bethesda, Maryland, 2003, pp. 11.