PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars

Authors

  • Abbas Nowzari-Dalini Department of Computer Science , School of Mathematics, Statistics, and Computer Science, University of Tehran, Tehran, IR Iran
  • Fatemeh Zare-Mirakabad Department of Computer Science, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, IR Iran
  • Hayedeh Ahrabian Department of Computer Science , School of Mathematics, Statistics, and Computer Science, University of Tehran, Tehran, IR Iran
  • Hesamedin Torabi Dashti Department of Mathematics, University of Wisconsin, Madison, USA
  • Nima Aghaeepour Department of Computer Science, University of British Columbia, Vancouver, Canada
Abstract:

Background: RNA molecules play many important regulatory, catalytic and structural roles in the cell, and RNA secondary structure prediction with pseudoknots is one the most important problems in biology. An RNA pseudoknot is an element of the RNA sec ondary structure in which bases of a single-stranded loop pair with complementary bases outside the loop. Modeling these nested structures (pseudoknots) causes numerous com putational diffilties and so it has been generally neglected in RNA structure prediction algorithms. Objectives: In this study, we present a new heuristic algorithm for the Prediction of RNA Knotted structures using Tree Adjoining Grammars (named PreRKTAG). Materials and Methods: For a given RNA sequence, PreRKTAG uses a genetic algorithm on tree adjoining grammars to propose a structure with minimum thermodynamic energy. The genetic algorithm employs a subclass of tree adjoining grammars as individuals by which the secondary structure of RNAs are modeled. Upon the tree adjoining grammars, new crossover and mutation operations were designed.The finess function is defied ac cording to the RNA thermodynamic energy function, which causes the algorithm conver gence to be a stable structure. Results: The applicability of our algorithm is demonstrated by comparing its iresults with three well-known RNA secondary structure prediction algorithms that support crossed structures. Conclusions: We performed our comparison on a set of RNA sequences from the RNAseP database, where the outcomes show effiency and practicality of the proposed algorithm.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

prerktag: prediction of rna knotted structures using tree adjoining grammars

background: rna molecules play many important regulatory, catalytic and structuralroles in the cell, and rna secondary structure prediction with pseudoknots is one themost important problems in biology. an rna pseudoknot is an element of the rna secondary structure in which bases of a single-stranded loop pair with complementary basesoutside the loop. modeling these nested structures (pseudokno...

full text

Modeling RNA Secondary Structures Using Tree Grammars

This paper proposes a grammatical tool, called tree adjunct grammar with tag for RNA ( denoted by TAG 2 RNA ), for representing secondary structures of RNAs, and shows some example TAG 2 RNA grammars for fairly complicated RNA secondary structures. We then demonstrate the appropriateness of the grammars for modeling RNA secondary structures by discussing its formal language and/or graph theoret...

full text

Synchronous Tree-Adjoining Grammars

The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages. The formalism's intended usage is to relate exp...

full text

Contextual Tree Adjoining Grammars

n rhi.\' pape1; 1i:e introduce a formalism called contextual tree adjoining grammar (CTAG). (::TAG.~ are a generalization of multi bracketed contextual reivriting gramnwrs (MBICR) which combine tree adjoini11g grammars (TAGs) and co11textual grammars. The generalization is to add a mechanism similar to obligatory adjoi11i11g in TAGs. Here, we present the definition o.f the model and some result...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 11  issue 1

pages  3- 13

publication date 2013-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023