Two-step genetic programming for optimization of RNA common-structure

5Citations
Citations of this article
305Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an algorithm for identifying putative non-coding RNA (ncRNA) using an RCSG (RNA Common-Structural Grammar) and show the effectiveness of the algorithm. The algorithm consists of two steps: structure learning step and sequence learning step. Both steps are based on genetic programming. Generally, genetic programming has been applied to learning programs automatically, reconstructing networks, and predicting protein secondary structures. In this study, we use genetic programming to optimize structural grammars. The structural grammars can be formulated as rules of tree structure including function variables. They can be learned by genetic programming. We have defined the rules on how structure definition grammars can be encoded into function trees. The performance of the algorithm is demonstrated by the results obtained from the experiments with RCSG of tRNA and 5S small RNA. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Nam, J. W., Joung, J. G., Ahn, Y. S., & Zhang, B. T. (2004). Two-step genetic programming for optimization of RNA common-structure. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3005, 73–83. https://doi.org/10.1007/978-3-540-24653-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free