Showing 2026 · cs.DMShow all
3 papers · 2 filters
cs.DM2026
The -metric to compare phylogenetic networks
Marc Hellmuth, Manuel Lafond, Guillaume E. Scholz
We introduce two novel distances for comparing rooted phylogenetic networks based on the -operator, which removes a vertex while preserving the ancestor relations among th…
cs.DM2026
Novel Triple-Based Problems for the Construction of Phylogenetic Networks via Least Common Ancestors
Patricia A. Ebert, Anna Lindeberg, Marc Hellmuth
Evolutionary histories are often represented by rooted phylogenetic networks, whose leaves correspond to extant taxa and whose internal vertices represent ancestral lineages. Since…
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…