Application Research On Biology Multiple Sequence Alignment Based On Genetic Simulated Annealing Algorithm

Sequence alignment of bioinformatics is an important fundament subject in bioinformatics research, one of its most basic task is multiple sequence alignments. Still there is not an optimal algorithm for multiple sequence alignments. This paper had proposeds a method, which use genetic algorithm and simulated annealing algorithm to solve the problems of multiple sequence alignments, The main work was summarized as follows:Firstly, we had analyzed of the traditional genetic algorithm and simulated annealing algorithm, exposed their the potential strengths and weaknesses. The simulated annealing algorithm was imported into the culling strategy and the subsistence strategy of genetic algorithm. By using simulated annealing algorithm into mitigate the stress of culling genetic algorithm and utilizing the Boltzmann mechanism of simulated annealing algorithm to control the acceptance of the individuals generated by crossovered and varied, a genetic stimulated annealing algorithm is proposed.Secondly, we had built up corresponding mathematical model and designed and developed a multiple sequence analysis procedures based on improved adaptive genetic algorithm. Then we had applied Genetic Simulated Annealing Algorithm to more specific nucleic acid and protein multiple sequences, to the experimental data, compared with the traditional genetic algorithm and ClustalX algorithm to achieve the sequence of procedures, it showed new algorithm had faster quality and stability of multiple sequence alignment, the results proved the feasibility and validity of the simulated annealing and genetic algorithm.