| dc.contributor | 應數系 | |
| dc.creator (作者) | 符麥克 | |
| dc.creator (作者) | Agranat-Tamir, Lily;Fuchs, Michael;Gittenberger, Bernhard;Rosenberg, Noah A. | |
| dc.date (日期) | 2026-09 | |
| dc.date.accessioned | 2-Sep-2026 13:11:42 (UTC+8) | - |
| dc.date.available | 2-Sep-2026 13:11:42 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-Sep-2026 13:11:42 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=184700 | - |
| dc.description.abstract (摘要) | In mathematical phylogenetics, the time-consistent galled trees provide a simple class of rooted binary network structures that can be used to represent a variety of different biological phenomena. We study the enumerative combinatorics of unlabeled and labeled time-consistent galled trees. We present a new derivation via the symbolic method of the number of unlabeled time-consistent galled trees with a fixed number of leaves and a fixed number of galls. We also derive new generating functions and asymptotics for labeled time-consistent galled trees. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Theoretical Computer Science, Vol.1082, Article:116075 | |
| dc.subject (關鍵詞) | Galled trees; Generating functions; Mathematical phylogenetics; Symbolic method | |
| dc.title (題名) | Enumerative combinatorics of unlabeled and labeled time-consistent galled trees | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.tcs.2026.116075 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.tcs.2026.116075 | |
