一种多搜索策略的多生物序列比对自适应遗传算法  

Multiple-Searching Adaptive Genetic Algorithm for Multiple Sequence Alignment

作　　者：司秀华[1] 陈国良[1] 

机构地区：[1]中国科学技术大学计算机科学技术系,国家高性能中心,安徽合肥230026

出　　处：《小型微型计算机系统》2006年第5期854-857,共4页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(2002AA104560;2001AA111041)资助

摘　　要：多生物序列比对是用来计算生物序列间相似性的重要工具,本文在引入熵来度量种群多样性的基础上,提出了一种多搜索策略的自适应遗传算法,其交叉和变异概率随着熵的变化进行自动调整,并且综合考虑了利用动态规划算法来设计遗传操作算子.实验结果表明,这个算法具有较强的全局搜索能力和局部搜索能力,并且能有效的克服未成熟收敛问题.The multiple sequence alignment can reveal sequence similarity; with the introduction of entropy of evaluating the diversity of population in genetic algorithm, this paper proposed a adaptive genetic algorithm for multiple sequence alignment, and probabilities of crossover and mutation were adjusted based on the entropy, furthermore, with the consideration of classical dynamic programming algorithms, this paper presented some new genetic operators. The experiment results showed that the algorithm presented can overcome permutation convergence and find global optima efficiently.

关 键 词：序列比对 遗传算法 熵 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]