Pages that link to "Item:Q730310"
From MaRDI portal
The following pages link to A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310):
Displaying 6 items.
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- Sharp upper and lower bounds on a restricted class of convex characters (Q2121794) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Combinatorial Scoring of Phylogenetic Networks (Q2817897) (← links)
- Convex Characters, Algorithms, and Matchings (Q6141866) (← links)
- A near-linear kernel for bounded-state parsimony distance (Q6142596) (← links)
