An annealing mutation operator in the genetic algorithms for RNA folding

An annealing mutation operator in the genetic algorithms (GA) for RNA folding on a MasPar MP-2 has been designed. The mutation probability descends along a hyperbola with respect to the size of the secondary structure, hence the total number of mutations at each generation drops linearly. Especially for long sequences with thousands of nucleotides as opposed to hundreds of nucleotides, the new mutation operator can make the distribution of free energies over all processors on MasPar MP-2 converge only after hundreds of generations. Based upon this new mutation operator, a technique to terminate the GA is also developed. The new mutation operator runs very efficiently. Some variations of the annealing mutation operator are also discussed.