A Genetic Algorithm for Inferring Pseudoknotted RNA Structures from Sequence Data
Pseudoknotted RNA structures are much more difficult to predict than non-pseudoknotted RNA structures both from the computational viewpoint and from the practical viewpoint. This is in part due to the unavailability of an exact energy model for pseudoknots, structural complexity of pseudoknots, and to the high time complexity of predicting algorithms. Therefore, existing approaches to predicting pseudoknotted RNA structures mostly focus on so-called H-type pseudoknots of small RNAs. We have developed a heuristic energy model and genetic algorithm for predicting RNA structures with various types of pseudoknots, including H-type pseudoknots. This paper analyzes the predictions by a genetic algorithm and compares the predictions to those by a dynamic programming algorithm.
KeywordsGenetic Algorithm Energy Model Dynamic Programming Algorithm Nest Loop Multiple Loop
Unable to display preview. Download preview PDF.
- 1.Lee, D., Han, K.: Prediction of RNA pseudoknots–comparative study of genetic algorithms. Genome Informatics 13, 414–415 (2002)Google Scholar
- 4.Shapiro, B.A., Wu, J.C.: An annealing mutation operator in the genetic algorithms for RNA folding. Computer Applications in the Biosciences 12, 171–180 (1996)Google Scholar
- 17.Reeder, J., Giegerich, R.: http://bibiserv.techfak.uni-bielefeld.de/pknotsrg/