Pages that link to "Item:Q2408842"
From MaRDI portal
The following pages link to Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842):
Displaying 16 items.
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
- Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
- Phylogenetic incongruence through the lens of monadic second order logic (Q2790162) (← links)
- (Q2830058) (redirect page) (← links)
- On Low Treewidth Graphs and Supertrees (Q2941748) (← links)
- Tree Compatibility and Inferring Evolutionary History (Q4290914) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)
- The agreement problem for unrooted phylogenetic trees is FPT (Q5494863) (← links)
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees (Q6487649) (← links)
- Embedding phylogenetic trees in networks of low treewidth (Q6599789) (← links)
- Composing dynamic programming tree-decomposition-based algorithms (Q6606983) (← links)