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
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
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
Constructing optimal trees from quartets
Journal of Algorithms
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
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
Layered graph drawing
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A satisfiability-based approach for embedding generalized tanglegrams on level graphs
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exact bipartite crossing minimization under tree constraints
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider the following problem (and variants thereof) that has important applications in the construction and evaluation of phylogenetic trees: Two rooted unordered binary 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. Our goal is to find two planar embeddings of the two trees (drawn without crossings) that minimize the number of crossings of the matching edges. We derive both (classical) complexity results and (parameterized) algorithms for this problem (and some variants thereof).