Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (24): 39-42.

• 研究、探讨 • Previous Articles     Next Articles

Phylogenetic tree constructing algorithm based on TSP

ZHANG Hongbin1,GUO Jing1,WANG Chao1,CHEN Ling2,3   

  1. 1.Department of Electronic and Information Engineering,Yangzhou Polytechnic Institute,Yangzhou,Jiangsu 225127,China
    2.College of Information Engineering,Yangzhou University,Yangzhou,Jiangsu 225009,China
    3.National Key Lab of Novel Software Tech,Nanjing University,Nanjing 210093,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-08-21 Published:2011-08-21

基于TSP的构建系统发生树的蚁群算法

张宏彬1,郭 静1,王 超1,陈 崚2,3   

  1. 1.扬州工业职业技术学院 电子信息工程系,江苏 扬州 225127
    2.扬州大学 信息工程学院,江苏 扬州 225009
    3.南京大学 软件新技术国家重点实验室,南京 210093

Abstract: Given a set of species and their distance matrix,TSP-PTC builds a weighed graph where each Hamilton circuit represents a phylogenetic tree.Among the phylogenetic trees corresponding to all circle paths,the optimal tree with minimum fitness value is the one which is corresponding to the solution of TSP.Artificial ants can be used to search an optimal path in the weighed graph.The optimal tree can be constructed by the optimal path and the distance matrix.

Key words: phylogenetic trees, Traveling Salesman Problem(TSP), ant colony algorithm, traverse

摘要: 受TSP问题的启发,提出一种基于TSP构建系统发生树的蚁群算法(TSP-PTC)。该算法将物种集合用一个带权图G表示,并利用蚁群算法在图中搜索一条最优路径,最终系统发生树用最优路径及距离矩阵构建而成。用该方法构建出来的系统发生树是一棵带权树,它不仅可以表示物种之间的进化关系,而且可以粗略地表示出物种之间的进化时间。

关键词: 系统发生树, 旅行商问题(TSP), 蚁群算法, 遍历