Pages that link to "Item:Q2464325"
From MaRDI portal
The following pages link to A faster FPT algorithm for the maximum agreement forest problem (Q2464325):
Displayed 8 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)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)