A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies
From MaRDI portal
Publication:5283825
Recommendations
- Constructing the R* consensus tree of two trees in subcubic time
- Constructing the R* consensus tree of two trees in subcubic time
- Some problems related to the space of optimal tree reconciliations (invited talk)
- Algorithms and Computation
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- An optimal algorithm for computing all subtree repeats in trees
- An optimal algorithm for computing all subtree repeats in trees
- Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
- Reconstructing a binary tree from its traversals in doubly logarithmic CREW time
- An efficient algorithm for some tree matching problems
Cites work
Cited in
(2)
This page was built for publication: A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283825)