Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Tanglegrams for rooted phylogenetic trees and networks
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 …
phylogenetic trees, in particular in multi-gene analysis or cospeciation studies. One …
Untangling tanglegrams: Comparing trees by their drawings
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 …
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 …
popular method consists in visualizing the trees face to face with links connecting matching …
Tanglegrams: a reduction tool for mathematical phylogenetics
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 …
labeling of pairs of leaf-labeled trees. These relative labelings are naturally formalized as …
Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability
A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are in one-
to-one correspondence; matching leaves are connected by inter-tree edges. For …
to-one correspondence; matching leaves are connected by inter-tree edges. For …
Comparing trees via crossing minimization
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 …
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 …
matching leaves in the two trees joined by an edge. Tanglegrams are widely used in …
A faster fixed-parameter approach to drawing binary tanglegrams
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 …
them by drawing them with leaves arranged side-by-side. To facilitate comparison, we would …
[HTML][HTML] Visualizing co-phylogenetic reconciliations
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 …
trees, that are map**s among the nodes of two trees with constraints on the leaves. The …
A tanglegram Kuratowski theorem
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 …
a perfect matching between the two leaf sets. Tanglegrams are drawn with the leaves on two …