Pages that link to "Item:Q306268"
From MaRDI portal
The following pages link to Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268):
Displaying 12 items.
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- On the complexity of computing MP distance between binary phylogenetic trees (Q1682616) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← 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)
- Phylogenetic incongruence through the lens of monadic second order logic (Q2790162) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- A near-linear kernel for bounded-state parsimony distance (Q6142596) (← links)
