Drawing binary tanglegrams: An experimental evaluation

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 106-119

  Nöllenburg, Martin ^a   Völker, Markus ^a   Wolff, Alexander ^b   Holten, Danny ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; INTEGER PROGRAMMING;

BRANCH-AND-BOUND ALGORITHMS; COMPLETE BINARY TREE; EXPERIMENTAL COMPARISON; EXPERIMENTAL EVALUATION; HIER-ARCHICAL CLUSTERING; INTEGER LINEAR PROGRAMS; OPTIMIZATION PROBLEMS; UNIQUE GAMES CONJECTURE;

BINARY TREES;

EID: 67650201268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.11     Document Type: Conference Paper

References (18)

1. P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput., 27(1):132- 169, 1998.
2. K. Buchin, M. Buchin, J. Byrka, M. Nollenburg, Y. Okamoto, R. I. Silveira, and A. Wolff. Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability. In I. G. Tollis and M. Patrignani, editors, Proc. 16th Internat. Sympos. Graph Drawing (GD'08), volume 5417 of Lecture Notes Comput. Sci., pages 324- 335. Springer-Verlag, 2009. Full version available at http://arxiv.org/abs/0806.0920.
3. T. Dwyer and F. Schreiber. Optimal leaf ordering for two and a half dimensional phylogenetic tree visualization. In N. Churcher and C. Churcher, editors, Proc. Australasian Sympos. Inform. Visual. (InVis.au'04), volume 35 of CRPIT, pages 109-115. Australian Computer Society, 2004.
4. P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 10:379-403, 1994.
5. H. Fernau, M. Kaufmann, and M. Poths. Comparing trees via crossing minimization. In R. Ramanujam and S. Sen, editors, Proc. 25th Intern. Conf. Found. Softw. Techn. Theoret. Comput. Sci. (FSTTCS'05), volume 3821 of Lecture Notes Comput. Sci., pages 457-469, 2005.
6. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. In Proc. 15th Ann. ACM Symp. Theory Comput. (STOC'83), pages 246-251, 1983.
7. S. Guindon and O. Gascuel. A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Systematic Biology, 52(5):696- 704, 2003.
8. M. S. Hafner, P. D. Sudman, F. X. Villablanca, T. A. Spradling, J. W. Demastes, and S. A. Nadler. Disparate rates of molecular evolution in cospeciating hosts and parasites. Science, 265:1087-1090, 1994.
9. D. Holten and J. J. van Wijk. Visual comparison of hierarchically organized data. In Proc. 10th Eurographics/IEEE-VGTC Sympos. Visualization (EuroVis'08), pages 759-766, 2008.
10. M. Junger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1(1):1-25, 1997.
11. H. Li. Constructing the TreeFam Database. PhD thesis, The Institute of Theoretical Physics, Chinese Academy of Science, 2006.
12. H. Li, A. Coghlan, J. Ruan, L. J. Coin, J.-K. Heriche, L. Osmotherly, R. Li, T. Liu, Z. Zhang, L. Bolund, G. K.-S. Wong, W. Zheng, P. Dehal, J. Wang, and R. Durbin. TreeFam: A curated database of phylogenetic trees of animal gene families. Nucleic Acids Research, 34:D572-D580, 2006.
13. A. Lozano, R. Y. Pinter, O. Rokhlenko, G. Valiente, and M. Ziv-Ukelson. Seeded tree alignment and planar tanglegram layout. In R. Giancarlo and S. Hannenhalli, editors, Proc. 7th Internat. Workshop Algorithms Bioinformatics (WABI'07), volume 4645 of Lecture Notes Comput. Sci., pages 98-110. Springer- Verlag, 2007.
14. X. Munoz, W. Unger, and I. Vrto. One sided crossing minimization is NP-hard for sparse graphs. In P. Mutzel, M. Junger, and S. Leipert, editors, Proc. 9th Internat. Sympos. Graph Drawing (GD'01), volume 2265 of Lecture Notes Comput. Sci., pages 115- 123. Springer-Verlag, 2002.
15. R. D. M. Page, editor. Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press, 2002.
16. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406-425, 1987.
17. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, 1981.
18. W. N. W. Zainon and P. Calder. Visualising phylogenetic trees. In W. Piekarski, editor, Proc. 7th Austalasian User Interface Conf. (AUIC'06), volume 50 of CRPIT, pages 145-152. Australian Comput. Soc., 2006.