When Three Trees Go to War
How many reticulations are needed for a phylogenetic network to display a given set of k phylogenetic trees on n leaves? For k = 2, Baroni et al. [Ann. Comb. 8, 391-408 (2005)] showed that the answer is n − 2. Here, we show that, for k ≥ 3 the answer is at least (3 /2 − ε)n. Concretely, we prove tha...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Peer Community In
2024-06-01
|
| Series: | Peer Community Journal |
| Online Access: | https://peercommunityjournal.org/articles/10.24072/pcjournal.419/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|