Pages that link to "Item:Q2069261"
From MaRDI portal
The following pages link to Reflections on kernelizing and computing unrooted agreement forests (Q2069261):
Displaying 4 items.
- Sharp upper and lower bounds on a restricted class of convex characters (Q2121794) (← links)
- Convex Characters, Algorithms, and Matchings (Q6141866) (← links)
- A near-linear kernel for bounded-state parsimony distance (Q6142596) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
