Pages that link to "Item:Q1028128"
From MaRDI portal
The following pages link to On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128):
Displaying 7 items.
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- On the Maximum Agreement Subtree Conjecture for Balanced Trees (Q5028359) (← links)
- Combinatorial Pattern Matching (Q5315328) (← links)