On multiple context-free grammars
Theoretical Computer Science
Tree adjoining grammars for RNA structure prediction
Theoretical Computer Science - Special issue: Genome informatics
Classifying RNA pseudoknotted structures
Theoretical Computer Science
biRNA: fast RNA-RNA binding sites prediction
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Fast prediction of RNA-RNA interaction
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Component-based matching for multiple interacting RNA sequences
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Time and space efficient RNA-RNA interaction prediction via sparse folding
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Hi-index | 0.01 |
Much attention has been paid to RNA-RNA interaction involved in posttranscriptional regulation of gene expression. Although there have been a few studies on secondary structure prediction of interacting RNAs using dynamic programming (DP) algorithms, no grammar-based approach has been proposed. This paper provides a new modeling for RNA-RNA interaction based on multiple context-free grammar (MCFG). We present a polynomial time parsing (prediction) algorithm of the stochastic version of MCFG. Experimental results show that our approach is comparable to an existing work based on DP. The MCFG-based approach is more flexible than other DP-based methods.