Pages that link to "Item:Q270010"
From MaRDI portal
The following pages link to Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010):
Displaying 13 items.
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- On the subnet prune and regraft distance (Q1740360) (← links)
- New Gromov-inspired metrics on phylogenetic tree space (Q1747644) (← links)
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT (Q2424823) (← links)
- A faster FPT algorithm for the maximum agreement forest problem (Q2464325) (← links)
- Fixed-parameter algorithms for maximum agreement forests (Q2862198) (← links)
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
