Limits...
Tanglegrams for rooted phylogenetic trees and networks.

Scornavacca C, Zickmann F, Huson DH - Bioinformatics (2011)

Bottom Line: 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.The algorithm is implemented in our program Dendroscope 3, which is freely available from www.dendroscope.org. scornava@informatik.uni-tuebingen.de; huson@informatik.uni-tuebingen.de.

View Article: PubMed Central - PubMed

Affiliation: Center for Bioinformatics (ZBIT), Tübingen University, Sand 14, 72076 Tübingen, Germany. scornava@informatik.uni-tuebingen.de

ABSTRACT

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.

Availability: The algorithm is implemented in our program Dendroscope 3, which is freely available from www.dendroscope.org.

Contact: scornava@informatik.uni-tuebingen.de; huson@informatik.uni-tuebingen.de.

Show MeSH
(a) A set of six circular splits Σ on 𝒳={a,b,…,h}. A circular ordering is given by (a,g,c,f,b,d,h,e). (b) An outer-labeled planar split network representing Σ.
© Copyright Policy - creative-commons
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC3117342&req=5

Figure 2: (a) A set of six circular splits Σ on 𝒳={a,b,…,h}. A circular ordering is given by (a,g,c,f,b,d,h,e). (b) An outer-labeled planar split network representing Σ.

Mentions: Circular splits are of particular interest because any set of circular splits can always be represented by a split network that can be drawn in the plane such that no two edges intersect and all labeled nodes lie on the outside of the network, see Figure 2.Fig. 2.


Tanglegrams for rooted phylogenetic trees and networks.

Scornavacca C, Zickmann F, Huson DH - Bioinformatics (2011)

(a) A set of six circular splits Σ on 𝒳={a,b,…,h}. A circular ordering is given by (a,g,c,f,b,d,h,e). (b) An outer-labeled planar split network representing Σ.
© Copyright Policy - creative-commons
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC3117342&req=5

Figure 2: (a) A set of six circular splits Σ on 𝒳={a,b,…,h}. A circular ordering is given by (a,g,c,f,b,d,h,e). (b) An outer-labeled planar split network representing Σ.
Mentions: Circular splits are of particular interest because any set of circular splits can always be represented by a split network that can be drawn in the plane such that no two edges intersect and all labeled nodes lie on the outside of the network, see Figure 2.Fig. 2.

Bottom Line: 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.The algorithm is implemented in our program Dendroscope 3, which is freely available from www.dendroscope.org. scornava@informatik.uni-tuebingen.de; huson@informatik.uni-tuebingen.de.

View Article: PubMed Central - PubMed

Affiliation: Center for Bioinformatics (ZBIT), Tübingen University, Sand 14, 72076 Tübingen, Germany. scornava@informatik.uni-tuebingen.de

ABSTRACT

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.

Availability: The algorithm is implemented in our program Dendroscope 3, which is freely available from www.dendroscope.org.

Contact: scornava@informatik.uni-tuebingen.de; huson@informatik.uni-tuebingen.de.

Show MeSH