Pages that link to "Item:Q1022593"
From MaRDI portal
The following pages link to The maximum agreement forest problem: Approximation algorithms and computational experiments (Q1022593):
Displayed 11 items.
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- 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 parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Faster exact computation of rSPR distance (Q2343983) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
- An Improved Approximation Algorithm for rSPR Distance (Q2817889) (← links)
- The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)