Pages that link to "Item:Q476897"
From MaRDI portal
The following pages link to Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897):
Displaying 13 items.
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← 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)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- Convex Characters, Algorithms, and Matchings (Q6141866) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
