2026-07-23T12:54:52Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16091 2024-03-06T10:56:56Z ddc:004 open_access

Enumeration of d-Combining Tree-Child Networks Chang, Yu-Sheng Fuchs, Michael Liu, Hexuan Wallner, Michael Yu, Guan-Ru Phylogenetic network tree-child network d-combining tree-child network exact enumeration asymptotic enumeration reticulation node limit law stretched exponential Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for bicombining tree-child networks which are tree-child networks with every reticulation node having exactly two parents. In this paper, we extend these studies to d-combining tree-child networks where every reticulation node has now d ≥ 2 parents. Moreover, we also give results and conjectures on the distributional behavior of the number of reticulation nodes of a network which is drawn uniformly at random from the set of all tree-child networks with the same number of leaves. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yu-Sheng Chang and Michael Fuchs and Hexuan Liu and Michael Wallner and Guan-Ru Yu 2022 Is Part Of LIPIcs, Volume 225, 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.AofA.2022.5 urn:nbn:de:0030-drops-160914 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2022.5 eng https://creativecommons.org/licenses/by/4.0/legalcode