一种改进的NJ方法及其应用  

An Improved Neighbor-Joining Method and Its Applications

作　　者：李玉鑑[1] 高凯[1] 

机构地区：[1]北京工业大学计算机学院,北京100124

出　　处：《北京工业大学学报》2009年第2期283-288,共6页Journal of Beijing University of Technology

基　　金：北京市自然科学基金资助项目(4052005);北京市属市管高等学校"中青年骨干教师培养计划"资助项目(PHR(IHLB)).

摘　　要：传统的邻接法(Neighbor-joining Method,简称NJ)存在"Tied trees"问题,即它从同一数据集中产生的进化树可能不唯一.为解决这一问题,提出了一种改进的NJ方法——INJ,该方法利用速率校正距离把多个最近的种群进行合并,并从理论和应用上说明INJ产生的进化树具有更好的唯一性,而且在NJ树唯一时,INJ树和NJ树完全相同.因此在传统NJ算法产生的二叉树不唯一时,INJ算法也能产生一棵具有唯一拓扑结构的多叉树.The problem of"tied trees"has been noticed in the traditional NJ(Neighbor Joining)method, which may produce more than one phylogenectic tree from a single data set,depending on the order of data entry.To solve this problem,this paper presented an improved NJ algorithm.Being different from the traditional NJ algorithm,the improved NJ repeatedly merged multiple groups into one by rate-corrected distance until only one group remained.The author shows in theory and application that the improved algorithm can al...

关 键 词：进化树 二叉树 多叉树 邻接法 距离矩阵 

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