Comparing trees via crossing minimization

24Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fernau, H., Kaufmann, M., & Poths, M. (2005). Comparing trees via crossing minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3821 LNCS, pp. 457–469). https://doi.org/10.1007/11590156_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free