| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Fuchs, Michael;Chang, Yu-Sheng | |
| dc.date (日期) | 2024-07 | |
| dc.date.accessioned | 28-十月-2024 13:15:41 (UTC+8) | - |
| dc.date.available | 28-十月-2024 13:15:41 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-十月-2024 13:15:41 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/154144 | - |
| dc.description.abstract (摘要) | 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. | |
| dc.format.extent | 106 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Bulletin of Mathematical Biology, Vol.86, No.7, article number 76 | |
| dc.subject (關鍵詞) | Phylogenetic network; Galled network; Reticulation-visible network; Enumeration; Component graph method | |
| dc.title (題名) | Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1007/s11538-024-01309-w | |
| dc.doi.uri (DOI) | https://doi.org/10.1007/s11538-024-01309-w | |
