scientific article; zbMATH DE number 871929
From MaRDI portal
Publication:4875202
zbMATH Open0848.68076MaRDI QIDQ4875202FDOQ4875202
Recommendations
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- An improved algorithm for the maximum agreement subtree problem
- Algorithms and Computation
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- An improved bound on the maximum agreement subtree problem
Cited in
(14)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- On the Maximum Agreement Subtree Conjecture for Balanced Trees
- Tree edit distance and maximum agreement subtree
- An improved bound on the maximum agreement subtree problem
- Computing the agreement of trees with bounded degrees
- Combinatorial Pattern Matching
- Computing the unrooted maximum agreement subtree in sub-quadratic time
- On the agreement of many trees
- Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species
- On the extremal maximum agreement subtree problem
- An improved algorithm for the maximum agreement subtree problem
- The maximum agreement subtree problem
- Algorithms and Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875202)
