Abstract
Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges between the leaves give a one-to-one correspondence between pairs of leaves of the different trees. Do there exist two planar embeddings of the two trees that minimize the crossings of the matching edges ? This problem has important applications in the construction and evaluation of phylogenetic trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Joseph, Z., Gifford, D., Jaakkola, T.: Fast optimal leaf ordering for hierarchical clustering. Bioinformatics 17, 22–29 (2001)
Bertolazzi, P., Liotta, G., Mannino, C., DI Battista, G.: Optimal upward planarity testing of single-source digraphs. SIAM Journal of Computing 27, 132–169 (1998)
Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337, 217–239 (2005)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation. In: Proc. Australasian Symp. on Information Visualisation (InVis.au 2004). CRPIT 35, pp. 109–115 (2004)
Eades, P., Whitesides, S.: Drawing graphs in two layers. Theoretical Computer Science 13, 361–374 (1994)
Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica 10, 379–403 (1994)
Fellows, M.R.: The Robertson-Seymour theorems: a survey of applications. Contemp. Math. 89, 1–18 (1989)
Fernau, H.: Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Universität Tübingen, Germany (2005) (submitted)
Huson, D.: Private Communication (2005)
Jiang, T., Wang, L., Zhang, K.: Alignment of trees—an alternative to tree edit. Theoretical Computer Science 143, 137–148 (1995)
Kilpeläinen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal of Computing 24, 340–356 (1995)
Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proc. of 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 696–704 (2000)
Ramesh, R., Ramakrishnan, I.: Nonlinear pattern matching in trees. Journal of the ACM 39, 295–316 (1992)
Zhang, K., Shasha, D.: Simple fast algorithms for the edit distance between trees and related problems. SIAM Journal of Computing 18, 1245–1262 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H., Kaufmann, M., Poths, M. (2005). Comparing Trees Via Crossing Minimization. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_37
Download citation
DOI: https://doi.org/10.1007/11590156_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)