The following pages link to Algorithms and Computation (Q5712163):
Displaying 8 items.
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- Unranked second-order anti-unification (Q2401634) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Select Tree Topologies (Q5283825) (← links)
