DocumentCode :
3722468
Title :
An Approach to Minimize Crossings in Phylogenetic Trees
Author :
Md Liakat Ali;Kutub Thakur;John V. Monaco;Meikang Qiu
Author_Institution :
Seidenberg Sch. of Comput. Sci. &
fYear :
2015
Firstpage :
42
Lastpage :
47
Abstract :
Visualization of phylogenetic trees became popular and has been widely used in biology, taxonomy, cloud computing, and bioinformatics. Different phylogenetic trees can be built based on different measures and methods. As a result, the problem became obvious when deciding which tree is better and most visually appealing. This often involves comparing two phylogenetic trees to each other. The main goal of this paper is to display a pair of alternative phylogenetic trees together while minimizing the number of crossings among the branches of both trees. This paper summarizes different tools and techniques used in visualizing phylogenetic trees in different studies and describes their limitations. After surveying different studies involved in crossings minimization, a naive algorithm to minimize the number of crossings is proposed.
Keywords :
"Phylogeny","Visualization","Vegetation","Couplings","Minimization","Data visualization","Bioinformatics"
Publisher :
ieee
Conference_Titel :
Cyber Security and Cloud Computing (CSCloud), 2015 IEEE 2nd International Conference on
Type :
conf
DOI :
10.1109/CSCloud.2015.47
Filename :
7371457
Link To Document :
بازگشت