4 papers
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…
Arboreal Networks and Ultrametrics
Katharina T. Huber, Vincent Moulton, Guillaume E. Scholz
Ultametrics are an important class of distances used in applications such as phylogenetics, clustering and classification theory. Ultrametrics are essentially distances that can be…
Orthology and Near-Cographs in the Context of Phylogenetic Networks
Anna Lindeberg, Guillaume E. Scholz, Nicolas Wieseke +1
Orthologous genes, which arise through speciation, play a key role in comparative genomics and functional inference. In particular, graph-based methods allow for the inference of o…
Representing distance-hereditary graphs with multi-rooted trees
Guillaume E. Scholz
Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is…