A Self-adaptive Ant Colony Algorithm for Phylogenetic Tree Construction

To solve the phylogenetic tree construction problem, a new method using adaptive ant colony algorithm based on the equilibrium of the ant distribution is presented. Before the problem is solved by the developed ant colony optimization, the input species were represented using a fully-connected graph built according to the evolutionary distance between each pair of species. The process of constructing a phylogenetic tree uses a pheromone graph. The information weight of the pheromone graph is adaptively updated according to the pheromone left by ants in their seeking process. The algorithm dynamically adjusts the influence of each ant to the trail information updating and the selected probability of the path according to the equilibrium of the ant distribution. The phylogenetic tree constructing method proposed here is tested using some test cases to compare its results with that of the neighbor-joining (NJ) programs in the PHYLIP software package and the TSP-Approach. Experimental results show that our algorithm is easier to implement and more efficient

[1]  E. Herniou,et al.  Use of Whole Genome Sequence Data To Infer Baculovirus Phylogeny , 2001, Journal of Virology.

[2]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Dong Xu,et al.  Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method , 2006, Int. J. Bioinform. Res. Appl..

[4]  Bailin Hao,et al.  Prokaryote phylogeny without sequence alignment: from avoidance signature to composition distance. , 2004, Journal of bioinformatics and computational biology.

[5]  Rolf Apweiler,et al.  Protein Information Resource (PIR) , 2004 .

[6]  Chen Hongjian,et al.  An Adaptive Ant Colony Algorithm Based on Equilibrium of Distribution , 2003 .

[7]  Stéphane Grumbach,et al.  A New Challenge for Compression Algorithms: Genetic Sequences , 1994, Inf. Process. Manag..

[8]  L. Buydens,et al.  Using genetic algorithms for the construction of phylogenetic trees: application to G-protein coupled receptor sequences. , 1999, Bio Systems.

[9]  Robert R. Sokal,et al.  A statistical method for evaluating systematic relationships , 1958 .

[10]  D. Snyers,et al.  New results on an ant-based heuristic for highlighting the organization of large graphs , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[11]  T Hodge,et al.  A myosin family tree. , 2000, Journal of cell science.

[12]  Gaston H. Gonnet,et al.  Using traveling salesman problem algorithms for evolutionary tree construction , 2000, Bioinform..

[13]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.