Pages that link to "Item:Q724246"
From MaRDI portal
The following pages link to Fast compatibility testing for rooted phylogenetic trees (Q724246):
Displaying 13 items.
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Phylogenetic graph models beyond trees (Q1026198) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Extension operations on sets of leaf-labelled trees (Q1914784) (← links)
- Corrigendum to: ``Best match graphs'' (Q2022091) (← links)
- Best match graphs with binary trees (Q2062000) (← 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)
- Best match graphs (Q2420450) (← links)
- On the ancestral compatibility of two phylogenetic trees with nested taxa (Q2433022) (← links)
- Treewidth of display graphs: bounds, brambles and applications (Q5233142) (← links)