2 papers
math.CO2025
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…
math.CO2025
Coconvex characters on collections of phylogenetic trees
Eva Czabarka, Steven Kelk, Vincent Moulton +1
In phylogenetics, a key problem is to construct evolutionary trees from collections of characters where, for a set X of species, a character is simply a function from X onto a set…