Showing cs.DMShow all
2 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…
cs.DM2025
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]…