Tanglegrams for rooted phylogenetic trees and networks

• DOI: 10.1093/bioinformatics/btr210
• Publication Date: 2011-06-17T23:32:32Z
• Authors: Celine Scornavacca; Franziska Zickmann; Daniel H. Huson
• Keywords: Reticulate; Tree (set theory); Reticulate evolution

In systematic biology, one is often faced with the task of comparing different phylogenetic trees, in particular multi-gene analysis or cospeciation studies. One approach to use a tanglegram which two rooted trees are drawn opposite each other, using auxiliary lines connect matching taxa. There an increasing interest networks represent evolutionary history, so as explicitly reticulate events, such horizontal gene transfer, hybridization reassortment. Thus, question arises how define and compute for networks.In this article, we present first formal definition heuristic computing one, called NN-tanglegram method. We compare performance our method existing tree algorithms also show typical application real biological datasets. For maximum usability, algorithm does not require that bifurcating bicombining, they on identical taxon sets.The implemented program Dendroscope 3, freely available from [e-mail]; [e-mail].