4 papers · 1 filter
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…
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…
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
Anna Lindeberg, Guillaume E. Scholz, Marc Hellmuth
In phylogenetics, reconstructing rooted trees from distances between taxa is a common task. Böcker and Dress generalized this concept by introducing symbolic dated maps $δ:X \times…