Using Ga-sa hybrid algorithm for multiplesequence alignment problem

Abstract

The analysis of DNA, Protein biology sequences for getting useful information from the similarity of them is very important basic problems. Nowadays there are many methods for solving these problems. However, defining the sequence similarity has not yet come up to our expectations. In this paper we put forth hybrid algorithms combining Genetic Alogorithms (GA) with Simulated Annealing Algorithm, from that these requirements could be harmonize, as well as their solutions could find in the short time interval, with high accuracy. The algorithms are performed by using the evolution information of biology sequences, and some heurictic rules to adjust the crossover, selection and mutation process in Genetic Algorithms. In addition, a part of the genetic population is used Annealing Algorithms to find a better new individual.