4 papers
The -metric to compare phylogenetic networks
Marc Hellmuth, Manuel Lafond, Guillaume E. Scholz
We introduce two novel distances for comparing rooted phylogenetic networks based on the -operator, which removes a vertex while preserving the ancestor relations among th…
The Parameterized Landscape of Labeled Graph Contractions
Manuel Lafond, Bertrand Marchand
In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possibl…
Finding Maximum Common Contractions Between Phylogenetic Networks
Bertrand Marchand, Nadia Tahiri, Olivier Tremblay-Savard +1
In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and…
Path Partitions of Phylogenetic Networks
Manuel Lafond, Vincent Moulton
In phylogenetics, evolution is traditionally represented in a tree-like manner. However, phylogenetic networks can be more appropriate for representing evolutionary events such as…