Title :
Permutation-based RNA secondary structure prediction via a genetic algorithm
Author :
Wiese, Kay C. ; Deschénes, Alain ; Glen, Edward
Author_Institution :
Inf. Technol., Simon Fraser Univ., Surrey, BC, Canada
Abstract :
This paper presents new results with a permutation-based genetic algorithm (GA) to predict the secondary structure of RNA molecules. More specifically, the proposed algorithm predicts which canonical base pairs forms hydrogen bonds and builds helices, also known as stems. We discuss a GA where a permutation is used to encode the secondary structure of RNA molecules. We have tested RNA sequences of lengths 76, 210, 681, and 785 nucleotides over a wide variety of operators and parameter settings and focus on discussing in depth the results with two crossover operators asymmetric edge recombinations (ASERC) and symmetric edge recombination (SYMERC) that have not been analyzed in this domain previously. We demonstrate that the keep-best reproduction (KBR) operator has similar benefits as in the travelling salesman problem (TSP) domain. We also compare the results of the permutation-based GA with a binary GA, demonstrating the benefits of the newly proposed representation.
Keywords :
biology computing; genetic algorithms; macromolecules; molecular biophysics; probability; travelling salesman problems; RNA molecules; RNA sequences; TSP domain; asymmetric edge recombinations; binary GA; canonical base pairs; crossover operators; helices; hydrogen bonds; keep-best reproduction operator; nucleotides; permutation-based GA; permutation-based RNA; permutation-based genetic algorithm; secondary structure prediction; stems; symmetric edge recombination; travelling salesman problem; Cities and towns; Encoding; Genetic algorithms; Genetic programming; Hydrogen; Nuclear magnetic resonance; Prediction algorithms; RNA; Road transportation; Testing;
Conference_Titel :
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN :
0-7803-7804-0
DOI :
10.1109/CEC.2003.1299595