1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees
Lily Agranat-Tamir, Michael Fuchs, Bernhard Gittenberger +2
Rooted binary phylogenetic networks are extensions of rooted binary trees, adding reticulation nodes that are designed to represent evolutionary processes that involve hybridizatio…
Galled Tree-Child Networks
Yu-Sheng Chang, Michael Fuchs, Guan-Ru Yu
We propose the class of galled tree-child networks which is obtained as intersection of the classes of galled networks and tree-child networks. For the latter two classes, (asympto…
Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks
Yu-Sheng Chang, Michael Fuchs
We give exact and asymptotic counting results for the number of galled networks and reticulation-visible networks with few reticulation vertices. Our results are obtained with the…
Asymptotic variance of random symmetric digital search trees
Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas
Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such…