A faster fixed-parameter approach to drawing binary tanglegrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 38-49

  Böcker, Sebastian ^a   Hüffner, Falk ^b   Truss, Anke ^a   Wahlström, Magnus ^c  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b TEL AVIV UNIVERSITY   (Israel)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE BINARY TREE; FAST TRANSFORMATION; LAYOUT PROBLEMS; N SPECIES; NP-HARD; PHYLOGENETIC TREES; REAL WORLD DATA; RUNNING TIME; SUBGRAPH PROBLEMS; SUBGRAPHS;

COMPUTATIONAL COMPLEXITY; DATA REDUCTION;

BINARY TREES;

EID: 72249087023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_3     Document Type: Conference Paper

References (9)

1. Bansal, M.S., Chang,W.-C., Eulenstein, O., Fernández-Baca, D.: Generalized binary tanglegrams: Algorithms and applications. In: Rajasekaran, S. (ed.) BICoB 2009. LNCS (LNBI), vol. 5462, pp. 114-125. Springer, Heidelberg (2009)
2. Baumann, F., Buchheim, C., Liers, F.: Exact crossing minimization in general tanglegrams. Technical Report zaik2009-581, Zentrum für Angewandte Informatik Köln (Mar 2009)
3. Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 324-335. Springer, Heidelberg (2009)
4. Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 457-469. Springer, Heidelberg (2005)
5. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proc. of ACM Symposium on Theory of Computing (STOC 1983), pp. 246-251. ACM Press, New York (1983)
6. Grötschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett. 1(1), 23-27 (1981)
7. Hüffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 297-310. Springer, Heidelberg (2007)
8. Nöllenburg, M., Holten, D., Völker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. In: Proc. of Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 106-119. SIAM, Philadelphia (2009)
9. Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press, Chicago (2002)