Examining the Appropriateness of Stochastic Context-Free Grammars in RNA Secondary Structure Prediction
نویسنده
چکیده
A context-free grammar G (henceforth abbreviated to “grammar”) is a 4-tuple (N,V, P, S) consisting of the following components: a finite set N of non-terminal variables, a finite set V of terminal variables that is disjoint from N , a finite set P of production rules, mapping non-terminal variables to a series of non-terminals and terminals, and a distinguished symbol S ∈ N that is the start symbol. Beginning with the start symbol, following production rules, a ‘string’ of terminal variables is produced (if this exists). A grammar might be represented as follows.
منابع مشابه
Stochastic Context-Free Grammars and RNA Secondary Structure Prediction
This thesis focus on the prediction of RNA secondary structure using stochastic context-free grammars (SCFG). The RNA secondary structure prediction problem consists of predicting a 2-dimensional structure from a 1-dimensional nucleotide sequence. The theory behind SCFG is explained and an overview of the research literature on various methods in the field of secondary structure prediction is g...
متن کاملIntroduction to stochastic context free grammars.
Stochastic context free grammars are a formalism which plays a prominent role in RNA secondary structure analysis. This chapter provides the theoretical background on stochastic context free grammars. We recall the general definitions and study the basic properties, virtues, and shortcomings of stochastic context free grammars. We then introduce two ways in which they are used in RNA secondary ...
متن کاملMaximizing Expected Base Pair Accuracy in RNA Secondary Structure Prediction by Joining Stochastic Context-Free Grammars Method
The identification of RNA secondary structures has been among the most exciting recent developments in biology and medical science. Prediction of RNA secondary structure is a fundamental problem in computational structural biology. For several decades, free energy minimization has been the most popular method for prediction from a single sequence. It is based on a set of empirical free energy c...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملAn evolutionary algorithm for stochastic context-free grammar design, with applications to RNA secondary structure prediction
Stochastic Context-Free Grammars (SCFGs) have been used widely in modelling RNA secondary structure. They were motivated by the use of Hidden Markov Models (HMMs) in protein modelling (Krogh et al., (1993)). What was lacking in HMMs though, was the ability to model long range interactions which are necessary to provide an effective model for RNA secondary structure. Thus, SCFGs, as generalisati...
متن کامل