3 papers
cs.DS2025
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…
cs.DS2024
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…
cs.DS2024
Median and Small Parsimony Problems on RNA trees
Bertrand Marchand, Yoann Anselmetti, Manuel Lafond +1
Motivation: Non-coding RNAs (ncRNAs) express their functions by adopting molecular structures. Specifically, RNA secondary structures serve as a relatively stable intermediate step…