Sciweavers

2 search results - page 1 / 1
» Drawing (Complete) Binary Tanglegrams: Hardness, Approximati...
Sort
View
52
Voted
CORR
2008
Springer
83views Education» more  CORR 2008»
14 years 10 months ago
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
14 years 11 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...