抄録
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.
本文言語 | English |
---|---|
ページ(範囲) | 204-206 |
ページ数 | 3 |
ジャーナル | Journal of Theoretical Biology |
巻 | 396 |
DOI | |
出版ステータス | Published - 2016 5月 7 |
外部発表 | はい |
ASJC Scopus subject areas
- 統計学および確率
- モデリングとシミュレーション
- 生化学、遺伝学、分子生物学(全般)
- 免疫学および微生物学(全般)
- 農業および生物科学(全般)
- 応用数学