We focus on finding a consensus motif of a set of homologous or functionally related RNA molecules. Recent approaches to this problem have been limited to simple motifs, require sequence alignment, and make prior assumptions concerning the data set. We use genetic programming to predict RNA consensus motifs based solely on the data set. Our system - dubbed GeRNAMo (Genetic programming of RNA Motifs) - predicts the most common motifs without sequence alignment and is capable of dealing with any motif size. Our program only requires the maximum number of stems in the motif and, if prior knowledge is available, the user can specify other attributes of the motif (e.g., the range of the motifs minimum and maximum sizes), thereby increasing both sensitivity and speed. We describe several experiments using either ferritin iron response element (IRE), signal recognition particle (SRP), or microRNA sequences showing that the most common motif is found repeatedly and that our system offers substantial advantages over previous methods.
|Number of pages||15|
|Journal||IEEE/ACM Transactions on Computational Biology and Bioinformatics|
|State||Published - 1 Oct 2007|
- Common motif
- Genetic programming (GP)
ASJC Scopus subject areas
- Applied Mathematics