A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
From MaRDI portal
Recommendations
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- On a matching distance between rooted phylogenetic trees
- Some approximation results for the maximum agreement forest problem
- A 3-approximation algorithm for the subtree distance between phylogenies
This page was built for publication: A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596272)