Minimising branch crossings in phylogenetic trees Online publication date: Thu, 16-Jun-2016
by Sung-Hyuk Cha; Yoo Jung An
International Journal of Applied Pattern Recognition (IJAPR), Vol. 3, No. 1, 2016
Abstract: While phylogenetic trees are widely used in bioinformatics, one of the major problems is that different dendrograms may be constructed depending on several factors. Albeit numerous quantitative measures to compare two different phylogenetic trees have been proposed, visual comparison is often necessary. Displaying a pair of alternative phylogenetic trees together by finding a proper order of taxa in the leaf level was considered earlier to give better visual insights of how two dendrograms are similar. This approach raised a problem of branch crossing. Here, a couple of efficient methods to count the number of branch crossings in the trees for a given taxa order are presented. Using the number of branch crossings as a fitness function, genetic algorithms are used to find a taxa order such that two alternative phylogenetic trees can be shown with semi-minimal number of branch crossing. A couple of methods to encode/decode a taxa order to/from a chromosome where genetic operators can be applied are also given.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Applied Pattern Recognition (IJAPR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook