Drawing (Complete) Binary Tanglegrams

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 applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minimum number of crossings is NP-hard and that the problem is fixed-parameter tractable with respect to that number.We prove that under the Unique Games Conjecture there is no constant-factor approximation for binary trees. We show that the problem is NP-hard even if both trees are complete binary trees. For this case we give an O(n3)-time 2-approximation and a new, simple fixed-parameter algorithm. We show that the maximization version of the dual problem for binary trees can be reduced to a version of MaxCut for which the algorithm of Goemans and Williamson yields a 0.878-approximation.

[1]  Jarke J. van Wijk,et al.  Visual Comparison of Hierarchically Organized Data , 2008, Comput. Graph. Forum.

[2]  Michael Kaufmann,et al.  Comparing trees via crossing minimization , 2005, J. Comput. Syst. Sci..

[3]  B. Dasgupta,et al.  On distances between phylogenetic trees , 1997, SODA '97.

[4]  Michael Kaufmann,et al.  Fixed parameter algorithms for one-sided crossing minimization revisited , 2003, J. Discrete Algorithms.

[5]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[6]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1998, SIAM J. Comput..

[7]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

[8]  Roderic D. M. Page,et al.  Tangled trees : phylogeny, cospeciation, and coevolution , 2003 .

[9]  S. Srinivasa Rao,et al.  A Simplified NP-Complete MAXSAT Problem , 1998, Inf. Process. Lett..

[10]  J. Davenport.  Editor , 1960 .

[11]  R. Monteiro,et al.  A projected gradient algorithm for solving the maxcut SDP relaxation , 2001 .

[12]  S. Nadler,et al.  Disparate rates of molecular evolution in cospeciating hosts and parasites. , 1994, Science.

[13]  Christoph Buchheim,et al.  Exact Bipartite Crossing Minimization under Tree Constraints , 2010, SEA.

[14]  Ron Y. Pinter,et al.  Seeded Tree Alignment and Planar Tanglegram Layout , 2007, WABI.

[15]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[16]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[17]  Hiroshi Nagamochi,et al.  An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings , 2005, Discret. Comput. Geom..

[18]  Alexander Wolff,et al.  Drawing Binary Tanglegrams: An Experimental Evaluation , 2008, ALENEX.

[19]  Alexander Wolff,et al.  Drawing (Complete) Binary Tanglegrams , 2008, Graph Drawing.

[20]  Alexander Wolff,et al.  Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability , 2008, ArXiv.

[21]  Magnus Wahlström,et al.  A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams , 2009, IWPEC.

[22]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[23]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[24]  Katherine St. John,et al.  Untangling Tanglegrams: Comparing Trees by Their Drawings , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[25]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[26]  Tim Dwyer,et al.  Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation , 2004, InVis.au.

[27]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[28]  David Fernández-Baca,et al.  Generalized Binary Tanglegrams: Algorithms and Applications , 2009, BICoB.