Abstract
A tree-based network on a set X of n leaves is said to be universal if any rooted binary phylogenetic tree on X can be its base tree. Francis and Steel showed that there is a universal tree-based network on X in the case of n = 3, 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 n>1.
Original language | English |
---|---|
Pages (from-to) | 204-206 |
Number of pages | 3 |
Journal | Journal of Theoretical Biology |
Volume | 396 |
DOIs | |
Publication status | Published - 2016 May 7 |
Externally published | Yes |
Keywords
- Binary phylogenetic network
- Reticulate evolution
- Tree-based network
ASJC Scopus subject areas
- Statistics and Probability
- Modelling and Simulation
- Biochemistry, Genetics and Molecular Biology(all)
- Immunology and Microbiology(all)
- Agricultural and Biological Sciences(all)
- Applied Mathematics