5 papers · 1 filter
NOC NOC, who's there? Clustering systems of tree-child and normal networks
Anna Lindeberg, Marc Hellmuth
Clustering systems provide a natural way to encode structural information contained in phylogenetic networks. In this note, we study the clustering systems of normal and tree-child…
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…
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…
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…
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…