On the existence of infinitely many universal tree-based networks
From MaRDI portal
(Redirected from Publication:306790)
Abstract: A tree-based network on a set of leaves is said to be universal if any rooted binary phylogenetic tree on can be its base tree. Francis and Steel showed that there is a universal tree-based network on in the case of , and asked whether such a network exists in general. We settle this problem by proving that there are infinitely many universal tree-based networks for any .
Recommendations
Cited in
(11)- A universal tree-based network with the minimum number of reticulations
- Tree-based unrooted phylogenetic networks
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- When is a phylogenetic network simply an amalgamation of two trees?
- Non-binary universal tree-based networks
- Tree-based networks: characterisations, metrics, and support trees
- A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks
- Phylogenetic networks that are their own fold-ups
- On determining if tree-based networks contain fixed trees
- Forest-based networks
- New characterisations of tree-based networks and proximity measures
This page was built for publication: On the existence of infinitely many universal tree-based networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306790)