| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Agranat-Tamir, Lily;Fuchs, Michael;Gittenberger, Bernhard;Rosenberg, Noah A.;Seetharaman, Karthik V. | |
| dc.date (日期) | 2026-10 | |
| dc.date.accessioned | 2-Sep-2026 13:11:41 (UTC+8) | - |
| dc.date.available | 2-Sep-2026 13:11:41 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-Sep-2026 13:11:41 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=184699 | - |
| dc.description.abstract (摘要) | Rooted binary phylogenetic networks are extensions of rooted binary trees, adding reticulation nodes that are designed to represent evolutionary processes that involve hybridization events. Enumerative combinatorics studies have counted leaf-labeled phylogenetic networks in a variety of classes, finding that when the number of reticulations is fixed, the time-consistent galled trees are asymptotically less numerous than each of several network classes that had been previously examined. Here we provide enumerative results on two additional network classes: general galled trees and simplex time-consistent galled trees. We show that for a fixed number of galls, as the number of leaves goes to infinity, the asymptotic count of general galled trees is identical to that of time-consistent galled trees, whereas the count of simplex time-consistent galled trees is smaller. If the number of galls is not restricted, then the asymptotic approximations all differ: simplex time-consistent galled trees are less numerous than time-consistent galled trees, which are in turn less numerous than general galled trees. We also report a variety of additional results: recursions to count the studied networks with small numbers of leaves and a fixed number of galls, as well as enumerative results for unlabeled networks in the classes that we investigate. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Advances in Applied Mathematics, Vol.180, Article:103131 | |
| dc.subject (關鍵詞) | Galled trees; Leaf-labeled trees; Phylogenetic networks; Symbolic method; Unlabeled trees | |
| dc.title (題名) | Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.aam.2026.103131 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.aam.2026.103131 | |
