| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Yu, Hao;Fuchs, Michael;Yu, Guan-Ru;Zhang, Louxin | |
| dc.date (日期) | 2026-04 | |
| dc.date.accessioned | 2-Sep-2026 13:11:43 (UTC+8) | - |
| dc.date.available | 2-Sep-2026 13:11:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-Sep-2026 13:11:43 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=184701 | - |
| dc.description.abstract (摘要) | Phylogenetic networks are powerful models for representing evolutionary history in studies of genome evolution involving reticulation events. The complex structure of phylogenetic networks makes their inference challenging, especially for large numbers of taxa. To better understand the full space of phylogenetic networks, we derive closed-form formulas for counting binary phylogenetic networks with two and three reticulation events. In addition, we also use our approach to give a simple proof of the known asymptotic result for a fixed number of reticulations. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Journal of Computational Biology, Vol.33, No.4, pp.386-400 | |
| dc.subject (關鍵詞) | count; phylogenetic networks; phylogeny | |
| dc.title (題名) | Exact and asymptotic counts of binary phylogenetic networks with a few reticulation events | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1177/15578666251400786 | |
| dc.doi.uri (DOI) | https://doi.org/10.1177/15578666251400786 | |
