Tanglegrams for rooted phylogenetic trees and networks

C Scornavacca, F Zickmann, DH Huson - Bioinformatics, 2011 - academic.oup.com
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 …

Untangling tanglegrams: Comparing trees by their drawings

B Venkatachalam, J Apple, KS John… - … /ACM Transactions on …, 2010 - ieeexplore.ieee.org
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two
trees joined by an edge. Tanglegrams are widely used in biology—to compare evolutionary …

Tanglegrams are misleading for visual evaluation of tree congruence

DM De Vienne - Molecular biology and evolution, 2019 - academic.oup.com
Evolutionary Biologists are often faced with the need to compare phylogenetic trees. One
popular method consists in visualizing the trees face to face with links connecting matching …

Tanglegrams: a reduction tool for mathematical phylogenetics

FA Matsen, SC Billey, A Kas… - IEEE/ACM transactions …, 2016 - ieeexplore.ieee.org
Many discrete mathematics problems in phylogenetics are defined in terms of the relative
labeling of pairs of leaf-labeled trees. These relative labelings are naturally formalized as …

Comparing trees via crossing minimization

H Fernau, M Kaufmann, M Poths - Journal of Computer and System …, 2010 - Elsevier
We consider the following problem (and variants thereof) that has important applications in
the construction and evaluation of phylogenetic trees: Two rooted unordered binary trees …

[HTML][HTML] Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation

A Wotzlaw, E Speckenmeyer, S Porschen - Discrete Applied Mathematics, 2012 - Elsevier
A tanglegram is a pair of (not necessarily binary) trees on the same set of leaves with
matching leaves in the two trees joined by an edge. Tanglegrams are widely used in …

A faster fixed-parameter approach to drawing binary tanglegrams

S Böcker, F Hüffner, A Truss, M Wahlström - Parameterized and Exact …, 2009 - Springer
Given two binary phylogenetic trees covering the same n species, it is useful to compare
them by drawing them with leaves arranged side-by-side. To facilitate comparison, we would …

[HTML][HTML] Visualizing co-phylogenetic reconciliations

T Calamoneri, V Di Donato, D Mariottini… - Theoretical Computer …, 2020 - Elsevier
We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic
trees, that are map**s among the nodes of two trees with constraints on the leaves. The …

A tanglegram Kuratowski theorem

É Czabarka, LA Székely, S Wagner - Journal of Graph Theory, 2019 - Wiley Online Library
A tanglegram consists of two rooted binary plane trees with the same number of leaves and
a perfect matching between the two leaf sets. Tanglegrams are drawn with the leaves on two …