Research in Computational Molecular Biology

Volume 3500 of the series Lecture Notes in Computer Science pp 172-187

Consensus Folding of Unaligned RNA Sequences Revisited

  • Vineet BafnaAffiliated withDept. of Computer Science and Engineering, University of California, San Diego
  • , Haixu TangAffiliated withSchool of Informatics and Center for Genomics and Bioinformatics, Indiana University
  • , Shaojie ZhangAffiliated withDept. of Computer Science and Engineering, University of California, San Diego

* Final gross prices may vary according to local VAT.

Get Access


As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as “RNA folding”) problem has attracted attention again, thanking to the recent discoveries of many novel non-coding RNA molecules. The two common approaches to this problem are de novo prediction of RNA secondary structure based on energy minimization and “consensus folding” approach (computing the common secondary structure for a set of unaligned RNA sequences). Consensus folding algorithms work well when the correct seed alignment is part of the input to the problem. However, seed alignment itself is a challenging problem for diverged RNA families.

In this paper, we propose a novel framework to predict the common secondary structure for unaligned RNA sequences. By matching putative stacks in RNA sequences, we make use of both primary sequence information and thermodynamic stability for prediction at the same time. We show that our method can predict the correct common RNA secondary structures even when we are only given a limited number of unaligned RNA sequences, and it outperforms current algorithms in sensitivity and accuracy.