基于遗传模拟退火算法的DNA多序列比对研究

The DNA Multiple Sequence Alignment based on Simulated Annealing Genetic Algorithm

针对生物信息学中DNA多序列比对问题,提出了一种基于遗传算法和模拟退火算法相结合的求解算法:在遗传模拟退火算法中,利用模拟退火算法针对遗传算子进行改进来提高算法的效率,由遗传算法进行全局搜索,模拟退火算法用于局部寻优,防止遗传算法的早熟收敛。通过与经典比对算法ClustalX和经典遗传算法进行比对研究,结果表明该算法是有效的。

About DNA multiple sequence alignment in bioinformatics, this article presents a solution that combines genetic algorithm and simulated annealing algorithm： Genetic Simulated Annealing Algorithm. In ge- netic simulated annealing algorithm, genetic algorithm searches in the whole space; simulated annealing algorithm is in charge of searching in local space, which avoids the premature phenomenon in genetic algorithm. By comparison research with classic algorithm, it proves this algorithm is effective.