Tanglegrams for rooted phylogenetic trees and networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Bioinformatics Année : 2011

Tanglegrams for rooted phylogenetic trees and networks

Résumé

MOTIVATION: In systematic biology, one is often faced with the task of comparing different phylogenetic trees, in particular in multi-gene analysis or cospeciation studies. One approach is to use a tanglegram in which two rooted phylogenetic trees are drawn opposite each other, using auxiliary lines to connect matching taxa. There is an increasing interest in using rooted phylogenetic networks to represent evolutionary history, so as to explicitly represent reticulate events, such as horizontal gene transfer, hybridization or reassortment. Thus, the question arises how to define and compute a tanglegram for such networks. RESULTS: In this article, we present the first formal definition of a tanglegram for rooted phylogenetic networks and present a heuristic approach for computing one, called the NN-tanglegram method. We compare the performance of our method with existing tree tanglegram algorithms and also show a typical application to real biological datasets. For maximum usability, the algorithm does not require that the trees or networks are bifurcating or bicombining, or that they are on identical taxon sets.
Fichier principal
Vignette du fichier
Scornavacca_09.pdf (858.25 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02155176 , version 1 (18-12-2019)

Identifiants

Citer

Celine Scornavacca, Franziska Zickmann, Daniel Huson. Tanglegrams for rooted phylogenetic trees and networks. Bioinformatics, 2011, 27 (13), pp.i248-i256. ⟨10.1093/bioinformatics/btr210⟩. ⟨hal-02155176⟩
95 Consultations
62 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More