基于遗传算法的最大似然法构建系统发生树  

Genetic algorithm-based maximum-likelihood method for regenerating phylogenetic tree

作　　者：李军令[1] 赵宏伟[1] 马志强[2] 魏利[1] 冯嘉[1] 关伟州[2] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012 [2]东北师范大学计算机学院,吉林长春130024

出　　处：《东北师大学报（自然科学版）》2008年第1期36-39,共4页Journal of Northeast Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助重点项目(60433020)

摘　　要：给出了一种基于遗传算法的最大似然法的建树方法,它是基于遗传算法的搜索最大似然树的启发式方法,将产生最优树和很多准最优树.这种技术在每次循环中只产生一棵树,并且在同代中没有重复的树出现.所以,结果树中含有最优树和很多准最优树,从而大大提高了搜索的效率.The data from categorizing microbial molecule are always used to regenerating phylogenetic tree. It can intuitionisticly and scientificly show the relative relationship among different OTUs. NJ, ML and MP are the most popular methods . This paper presents a new method-genetic algorithm-based maximum-likelihood method. A heuristic approach to search for the maximum-likehood phylogenetic tree based on a genetic algorithm outputs the best tree as well as multiple alternative trees that are not significantly worse than the best one on the basis of the likehood criterion. A technique called steady-state reproduction without duplication is applied, in which only one new tree is generated in one cycle . Consequently, the resulting population consists of the best tree and alternative trees which have near-potimum likehood values.

关 键 词：遗传算法 系统发生 最大似然 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]