Tree adjoining grammars for RNA structure prediction
Theoretical Computer Science - Special issue: Genome informatics
Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Small Subunit Ribosomal RNA Modeling Using Stochastic Context-Free Grammars
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Hi-index | 0.02 |
Stochastic Context-Free Grammars (SCFG) has been shown to beeffective in modelling RNA secondary structure for searches. Ourprevious work (Cai et al., 2003) in Stochastic ParallelCommunicating Grammar Systems (SPCGS) has extended SCFG to modelRNA pseudoknots. However, the alignment algorithm requiresO(n4) memory for a sequence of length n. In this paper,we develop a memory efficient algorithm for sequence-structurealignments including pseudoknots. This new algorithm reduces thememory space requirement from O(n4) to O(n2)without increasing the computation time. Our experiments have shownthat this novel approach can achieve excellent performance onsearching for RNA pseudoknots.