Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2401.08958 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914760899952640 |
|---|---|
| author | Chang, Yu-Sheng Fuchs, Michael |
| author_facet | Chang, Yu-Sheng Fuchs, Michael |
| contents | We give exact and asymptotic counting results for the number of galled networks and reticulation-visible networks with few reticulation vertices. Our results are obtained with the component graph method, which was introduced by L. Zhang and his coauthors, and generating function techniques. For galled networks, we in addition use analytic combinatorics. Moreover, in an appendix, we consider maximally reticulated reticulation-visible networks and derive their number, too. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_08958 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks Chang, Yu-Sheng Fuchs, Michael Combinatorics 05A15, 92B05 We give exact and asymptotic counting results for the number of galled networks and reticulation-visible networks with few reticulation vertices. Our results are obtained with the component graph method, which was introduced by L. Zhang and his coauthors, and generating function techniques. For galled networks, we in addition use analytic combinatorics. Moreover, in an appendix, we consider maximally reticulated reticulation-visible networks and derive their number, too. |
| title | Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks |
| topic | Combinatorics 05A15, 92B05 |
| url | https://arxiv.org/abs/2401.08958 |