Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Whole Genome Phylogeny Based on Clustered Signature String Composition
CSBW '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference - Workshops
A Divide-and-Conquer Implementation of Three Sequence Alignment and Ancestor Inference
BIBM '07 Proceedings of the 2007 IEEE International Conference on Bioinformatics and Biomedicine
International Journal of Bioinformatics Research and Applications
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Two hybrid ant algorithms for the general T-colouring problem
International Journal of Bio-Inspired Computation
A dynamic max-min ant system for solving the travelling salesman problem
International Journal of Bio-Inspired Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Domain information based prediction of protein-protein interactions of glucosinolate biosynthesis
International Journal of Computer Applications in Technology
International Journal of Computer Applications in Technology
A genetic ant colony algorithm for routing in CPS heterogeneous network
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
We present a new method for constructing the phylogenetic tree from a given set of gene sequences. The method first bisects the set of gene sequences into subsets so that the sequences are similar to one another within the same subset and are dissimilar to the ones in the other subset. Such bisecting procedure is executed recursively until each of the subset contains only one gene sequence. With these subsets in different levels, a phylogenetic tree is progressively constructed. Each level of bisecting is based on the ant colony optimisation algorithm. Our phylogenetic tree-constructing method is tested to compare its performance with that of the other similar methods. Experimental results show that our method can obtain higher speed, superior quality results and is easier to implement.