An ant colony optimisation algorithm for constructing phylogenetic tree
by Ling Chen; Wei Liu; Ling Qin; Bolun Chen
International Journal of Computer Applications in Technology (IJCAT), Vol. 44, No. 2, 2012

Abstract: 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.

Online publication date: Thu, 23-Aug-2012

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com