Abstract :
We propose a two-level stochastic context-free grammar (SCFG) architecture for parametrized stochastic modeling of a family of RNA sequences, including their secondary structure. A stochastic model of this type can be used for maximum a posteriori estimation of the secondary structure of any new sequence in the family. The proposed SCFG architecture models RNA subsequences comprising paired bases as stochastically weighted Dyck-language words, i.e., as weighted balanced- parenthesis expressions. The length of each run of unpaired bases, forming a loop or a bulge, is taken to have a phase-type distribution: that of the hitting time in a finite-state Markov chain. Without loss of generality, each such Markov chain can be taken to have a bounded complexity. The scheme yields an overall family SCFG with a manageable number of parameters.
Keywords :
Markov processes; biology computing; context-free grammars; macromolecules; maximum likelihood estimation; molecular biophysics; organic compounds; statistical distributions; Dyck-language words; RNA secondary structure; RNA sequence; finite-state Markov chain; maximum a posteriori estimation; parametrized stochastic modelling; phase-type distribution; probability distribution; stochastic context-free grammar; Biological system modeling; Context modeling; Hidden Markov models; Mathematical model; Parameter estimation; Predictive models; Probability distribution; RNA; Sequences; Stochastic processes;