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…