Showing 2026Show all
3 papers · 1 filter
cs.DM2026
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…
math.CO2026
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…
q-bio.PE2026
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…