Drawing Binary Tanglegrams: An Experimental Evaluation

@inproceedings{Nllenburg2009DrawingBT,
  title={Drawing Binary Tanglegrams: An Experimental Evaluation},
  author={Martin N{\"o}llenburg and Danny Holten and Markus V{\"o}lker and Alexander Wolff},
  booktitle={ALENEX},
  year={2009}
}
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 hierarchical clustering, it is required that the individual trees are drawn crossing-free. A natural optimization problem, denoted tanglegram layout problem, is thus to minimize the number of crossings between inter-tree edges. The tanglegram layout problem is NP-hard even for complete binary trees, for general binary trees… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Tangled Trees: Phylogeny, Cospeciation, and Coevolution

  • R.D.M. Page, editor
  • 2002
Highly Influential
3 Excerpts

Comparing trees via crossing minimization LunarVis – Analytic Visualizations of Large Graphs

  • P. D. Sudman M. S. Hafner, F. X. Villablanca, T. A. Spradling, J. W. Demastes, S. A. Nadler
  • Proc . 15 th Internat . Sympos . Graph Drawing…
  • 2008

Similar Papers

Loading similar papers…