The Community for Technology Leaders
RSS Icon
Issue No.04 - October-December (2010 vol.7)
pp: 588-597
Jim Apple , University of California Davis, Davis
Katherine St. John , Lehman College and City University of New York, New York
Dan Gusfield , University of California Davis, Davis
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology—to compare evolutionary histories of host and parasite species and to analyze genes of species in the same geographical area. We consider optimization problems in tanglegram drawings. We show a linear time algorithm to decide if a tanglegram admits a planar embedding by a reduction to the planar graph drawing problem. This problem was also studied by Fernau et al. [15]. A similar reduction to a graph crossing problem also helps to solve an open problem they posed, showing a fixed-parameter tractable algorithm for minimizing the number of crossings over all d-ary trees. For the case where one tree is fixed, we show an O(n {\log} n) algorithm to determine the drawing of the second tree that minimizes the number of crossings. This improves the bound from earlier methods. We introduce a new optimization criterion using Spearman's footrule distance and give an O(n^2) algorithm. We also show integer programming formulations to quickly obtain tanglegram drawings that minimize the two optimization measures discussed. We prove lower bounds on the maximum gap between the optimal solution and the heuristic of Dwyer and Schreiber [13] to minimize crossings.
Optimization, combinatorial algorithms, graph algorithms, trees, analysis of algorithms, phylogeny, tree comparison, graph drawing, combinatorics.
Jim Apple, Katherine St. John, Dan Gusfield, "Untangling Tanglegrams: Comparing Trees by Their Drawings", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, no. 4, pp. 588-597, October-December 2010, doi:10.1109/TCBB.2010.57
[1] M.S. Bansal, W.-C. Chang, O. Eulenstein, and D. Fernández-Baca, "Generalized Binary Tanglegrams: Algorithms and Applications," Proc. First Int'l Conf. Bioinformatics and Computational Biology (BICoB), pp. 114-125, 2009.
[2] P. Bertolazzi, G.D. Battista, C. Mannino, and R. Tamassia, "Optimal Upward Planarity Testing of Single-Source Digraphs," SIAM J. Computing, vol. 27, no. 1, pp. 132-169, 1998.
[3] D. Bertsimas and R. Weismantel, Optimization Over Integers. Dynamic Ideas, May 2005.
[4] T.C. Biedl, F.-J. Brandenburg, and X. Deng, "Crossings and Permutations," Proc. 13th Int'l Symp. Graph Drawing, pp. 1-12, 2005.
[5] S. Böcker, F. Hffner, A. Truss, and M. Wahlström, "A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams," Proc. Fourth Int'l Workshop Parameterized and Exact Computation (IWPEC '09), 2009.
[6] M.R. Brown and R.E. Tarjan, "Design and Analysis of a Data Structure for Representing Sorted Lists," SIAM J. Computing, vol. 9, no. 3, pp. 594-614, 1980.
[7] K. Buchin, M. Buchin, J. Byrka, M. Nöllenburg, Y. Okamoto, R.I. Silveira, and A. Wolff, "Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability," Proc. 16th Int'l Symp. Graph Drawing, pp. 324-335, 2008.
[8] A. Burt and R. Trivers, Genes in Conflict. Belknap Press of Harvard Univ. Press, 2006.
[9] M. Charleston and S. Perkins, "Lizards, Malaria, and Jungles in the Caribbean," Tangled Trees: Phylogeny, Cospeciation, and Coevolution, R. Page, ed., pp. 65-92, Univ. of Chicago Press, 2003.
[10] P. Diaconis and R.L. Graham, "Spearman's Footrule as a Measure of Disarray," J. Royal Statistical Soc. Series B (Methodological), vol. 39, no. 2, pp. 262-268, 1977.
[11] R. Diestel, Graph Theory, third ed., Springer-Verlag, 2005.
[12] C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, "Rank Aggregation Methods for the Web," Proc. 10th Int'l Conf. World Wide Web (WWW), pp. 613-622, 2001.
[13] T. Dwyer and F. Schreiber, "Optimal Leaf Ordering for Two and a Half Dimensional Phylogenetic Tree Visualisation," Proc. Australasian Symp. Information Visualisation, pp. 109-115, 2004.
[14] R. Fagin, R. Kumar, and D. Sivakumar, "Comparing Top k Lists," Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 28-36, 2003.
[15] H. Fernau, M. Kaufmann, and M. Poths, "Comparing Trees via Crossing Minimization," Proc. Ann. Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 457-469, 2005.
[16] L.R. Foulds and R.L. Graham, "The Steiner Problem in Phylogeny is NP-Complete," Advances in Applied Math., vol. 3, no. 1, pp. 43-49, 1982.
[17] M.R. Garey and D.S. Johnson, "Crossing Number is NP-Complete," SIAM J. Algebraic and Discrete Methods, vol. 4, no. 3, pp. 312-316, 1983.
[18] D.M. Hillis, T.A. Heath, and K.St. John, "Analysis and Visualization of Tree Space," Systematic Biology, vol. 54, no. 3, pp. 471-482, 2005.
[19] R. Hinze and R. Paterson, "Finger Trees: A Simple General-Purpose Data Structure," J. Functional Programming, vol. 16, no. 2, pp. 197-217, 2006.
[20] D. Holten and J.J. van Wijk, "Visual Comparison of Hierarchically Organized Data," Computer Graphics Forum, vol. 27, no. 3, pp. 759-766, 2008.
[21] J.E. Hopcroft and R.E. Tarjan, "Efficient Planarity Testing," J. ACM, vol. 21, no. 4, pp. 549-568, 1974.
[22] J.P. Huelsenbeck and F. Ronquist, Mrbayes: Bayesian Inference of Phylogeny, 2001.
[23] H. Kaplan and R.E. Tarjan, "Purely Functional Representations of Catenable Sorted Lists," Proc. 28th Ann. ACM Symp. Theory of Computing (STOC), pp. 202-211, 1996.
[24] K. Kawarabayashi and B. Reed, "Computing Crossing Number in Linear Time," Proc. 39th Ann. ACM Symp. Theory of Computing (STOC), pp. 382-390, 2007.
[25] J. Lee, "All-Different Polytopes," J. Combinatorial Optimization, vol. 6, no. 3, pp. 335-352, 2002.
[26] A. Lozano, R.Y. Pinter, O. Rokhlenko, G. Valiente, and M. Ziv-Ukelson, "Seeded Tree Alignment and Planar Tanglegram Layout," Proc. Seventh Int'l Workshop Algorithms in Bioinformatics (WABI), pp. 98-110, 2007.
[27] M. Nöllenburg, D. Holten, M. Völker, and A. Wolff, "Drawing Binary Tanglegrams: An Experimental Evaluation," Proc. 11th Workshop Algorithm Eng. and Experiments (ALENEX), pp. 106-119, 2009.
[28] R.D.E. Page, Tangled Trees: Phylogeny, Cospeciation, and Coevolution. Univ. of Chicago Press, 2002.
[29] S. Roch, "A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 92-94, Jan.-Mar. 2006.
[30] W.K. Shih and W.-L. Hsu, "A New Planarity Test," Theoretical Computer Science, vol. 223, nos. 1-2, pp. 179-191, 1999.
[31] D.L. Swofford, PAUP∗. Phylogenetic Analysis Using Parsimony (∗and Other Methods), Version 4. Sinauer Assoc., 2002.
[32] D.L. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis, "Phylogenetic Inference," Molecular Systematics, second ed., pp. 407-514, Sinauer Assoc., 1996.
[33] B. Venkatachalam, J. Apple, K.St. John, and D. Gusfield, "Untangling Tanglegrams: Comparing Trees by Their Drawings," Technical Report CSE-2009-1, UC Davis, Computer Science Dept., 2009.
[34] B. Venkatachalam, J. Apple, K.St. John, and D. Gusfield, "Untangling Tanglegrams: Comparing Trees by Their Drawings," Proc. Fifth Int'l Symp. Bioinformatics Research and Applications (ISBRA '09), pp. 88-99, 2009.
[35] W.N. Wan Zainon and P. Calder, "Visualising Phylogenetic Trees," Proc. Seventh Australasian User Interface Conf. (AUIC '06), Conf. Research and Practice in Information Technology (CRPIT), vol. 50, W. Piekarski, ed., pp. 145-152, 2006.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool