Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Semi-simplex phylogenetic networks: Tree-child networks and galled trees
作者 符麥克
Fuchs, Michael;Yu, Tsan-Cheng
貢獻者 應數系
關鍵詞 Semi-simplex networks; tree-child networks; galled trees; enumeration; limit laws; Sackin index
日期 2026-06
上傳時間 2-Sep-2026 13:12:19 (UTC+8)
摘要 Understanding the size of phylogenetic network classes and the typical shape of a random network from a fixed class has been one of the major research focuses in phylogenetics over the last couple of years. In this extended abstract, we consider two subclasses of the (recently introduced) class of semi-simplex phylogenetic networks, namely, semi-simplex tree-child networks and semi-simplex galled trees. We clarify their sizes relative to the (known) sizes of general tree-child networks and galled trees, respectively, and prove limit laws for parameters of random networks from these classes. Additional classes of semi-simplex networks will be considered in the journal version of this paper.
關聯 Proceedings of the 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, LMU Munich, Paper 5
資料類型 conference
DOI https://doi.org/10.4230/LIPIcs.AofA.2026.5
dc.contributor 應數系
dc.creator (作者) 符麥克
dc.creator (作者) Fuchs, Michael;Yu, Tsan-Cheng
dc.date (日期) 2026-06
dc.date.accessioned 2-Sep-2026 13:12:19 (UTC+8)-
dc.date.available 2-Sep-2026 13:12:19 (UTC+8)-
dc.date.issued (上傳時間) 2-Sep-2026 13:12:19 (UTC+8)-
dc.identifier.uri (URI) https://ah.lib.nccu.edu.tw/item?item_id=184706-
dc.description.abstract (摘要) Understanding the size of phylogenetic network classes and the typical shape of a random network from a fixed class has been one of the major research focuses in phylogenetics over the last couple of years. In this extended abstract, we consider two subclasses of the (recently introduced) class of semi-simplex phylogenetic networks, namely, semi-simplex tree-child networks and semi-simplex galled trees. We clarify their sizes relative to the (known) sizes of general tree-child networks and galled trees, respectively, and prove limit laws for parameters of random networks from these classes. Additional classes of semi-simplex networks will be considered in the journal version of this paper.
dc.format.extent 106 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) Proceedings of the 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, LMU Munich, Paper 5
dc.subject (關鍵詞) Semi-simplex networks; tree-child networks; galled trees; enumeration; limit laws; Sackin index
dc.title (題名) Semi-simplex phylogenetic networks: Tree-child networks and galled trees
dc.type (資料類型) conference
dc.identifier.doi (DOI) 10.4230/LIPIcs.AofA.2026.5
dc.doi.uri (DOI) https://doi.org/10.4230/LIPIcs.AofA.2026.5