6 papers
Encoding Phylogenetic Networks with Least Common Ancestor Constraints
Marc Hellmuth, Anna Lindeberg, Vincent Moulton
Encoding phylogenetic networks by suitable substructures is a central problem in phylogenetic combinatorics. We study encodings based on least common ancestor (LCA) constraints. Fo…
EL-Shellability of the poset of ranked cactuses
Vincent Moulton, Andreas Spillner, Antonia Stavemann
Recently the poset of ranked cactuses was introduced. For a finite set , this poset consists of a set of certain collections of ord…
Regularizing and Normalizing DAGs and Phylogenetic Networks
Marc Hellmuth, Anna Lindeberg, Vincent Moulton
Phylogenetic networks and, more generally, directed acyclic graphs (DAGs) represent hierarchical structure beyond trees, for instance in the presence of reticulate evolutionary eve…
Labeling and folding multi-labeled trees
Vincent Moulton, Andreas Spillner
In 1989 Erdős and Székely showed that there is a bijection between (i) the set of rooted trees with vertices whose leaves are bijectively labeled with the elements of $[\ell]…
Spaces of ranked tree-child networks
Vincent Moulton, Andreas Spillner
Ranked tree-child networks are a recently introduced class of rooted phylogenetic networks in which the evolutionary events represented by the network are ordered so as to respect…
Phylogenetic diversity indices from an affine and projective viewpoint
Vincent Moulton, Andreas Spillner, Kristina Wicke
Phylogenetic diversity indices are commonly used to rank the elements in a collection of species or populations for conservation purposes. The derivation of these indices is typica…