8 papers
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…
Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
Anna Lindeberg, Anton Alfonsson, Vincent Moulton +2
A least common ancestor (LCA) of two leaves in a directed acyclic graph (DAG) is a vertex that is an ancestor of both leaves and has no proper descendant that is also their common…
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…
Global Least Common Ancestor (LCA) Networks
Anna Lindeberg, Bruno J. Schmidt, Manoj Changat +3
Directed acyclic graphs (DAGs) are fundamental structures used across many scientific fields. A key concept in DAGs is the least common ancestor (LCA), which plays a crucial role i…
Characterizing and Transforming DAGs within the I-LCA Framework
Marc Hellmuth, Anna Lindeberg
We explore the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs), focusing on the interplay between so-called -lca-relevant DAGs a…