Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Nonlinear pattern matching in trees
Journal of the ACM (JACM)
Theoretical Computer Science
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation
APVis '04 Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35
A survey on tree edit distance and related problems
Theoretical Computer Science
Parameterized Complexity
Drawing (Complete) Binary Tanglegrams
Graph Drawing
Generalized Binary Tanglegrams: Algorithms and Applications
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Untangling Tanglegrams: Comparing Trees by Their Drawings
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Parameterized algorithms for d-Hitting Set: The weighted case
Theoretical Computer Science
Matched drawings of planar graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Untangling Tanglegrams: Comparing Trees by Their Drawings
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized algorithms for HITTING SET: the weighted case
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
| Hi-index | 0.00 |
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.