基于后缀法与遗传退火算法的简约树构建  

The construction of maximum parsimony tree based on suffix method and genetic annealing algorithm

作　　者：刘清雪 王亮 LIU Qingxue;WANG Liang(School of Computer Science & Engineering, Jilin University of Architecture and Technology, Changchun 130111, China)

机构地区：[1]吉林建筑科技学院计算机科学与工程学院,吉林长春130111

出　　处：《长春工业大学学报》2021年第3期274-278,共5页Journal of Changchun University of Technology

基　　金：吉林省教育厅“十三五”科学技术项目(JJKH20201232KJ);吉林建筑科技学院重点项目(校科字[2018]004号)。

摘　　要：利用二进制树通过后缀法编码将N个物种的系统发生树与后缀法编码进行一一对应,并在遗传算子的设计中引入退火算子,通过遗传算法与退火算法相组合寻找全局最优解。计算结果表明,改进算法在简化树存贮的同时,还提高了运行速度。Based on the binary tree coding by suffix method,the phylogenetic tree of n species is coded with suffix method,and the annealing operator is introduced into the design of genetic operator.The genetic algorithm and annealing algorithm are combined to find the global optimal solution.The results show that the improved algorithm not only simplifies the storage of the tree,but also improves the running speed.

关 键 词：系统发生树 最大简约法 遗传算法 后缀法编码 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]