4 citations · 4 across the 3 of their papers we have counts for
6 papers · 1 filter
Enumeration of -combining Tree-Child Networks
Yu-Sheng Chang, Michael Fuchs, Hexuan Liu +2
Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed count…
Compacted binary trees admit a stretched exponential
Andrew Elvey Price, Wenjie Fang, Michael Wallner
A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that…
Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
Cedric Chauve, Yann Ponty, Michael Wallner
Given a set of species whose evolution is represented by a species tree, a gene family is a group of genes having evolved from a single ancestral gene. A gene family evolves along…
Combinatorics of nondeterministic walks of the Dyck and Motzkin type
Elie De Panafieu, Mohamed Lamine Lamali, Michael Wallner
This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. At each step, a nondeterministic walk draws a random set of steps from a predefined s…
Local time for lattice paths and the associated limit laws
Cyril Banderier, Michael Wallner
For generalized Dyck paths (i.e., directed lattice paths with any finite set of jumps), we analyse their local time at zero (i.e., the number of times the path is touching or cross…
A half-normal distribution scheme for generating functions and the unexpected behavior of Motzkin paths
Michael Wallner
We present an extension of a theorem by Michael Drmota and Michèle Soria [Images and Preimages in Random Mappings, 1997] that can be used to identify the limiting distribution for…