Graph editing to a fixed target

For a fixed graph H, the H-Minor Edit problem takes as input a graph G and an integer k and asks whether G can be modified into H by a total of at most k edge contractions, edge deletions and vertex deletions. Replacing edge contractions by vertex dissolutions yields the H-Topological Minor Edit problem. For each problem we show polynomial-time solvable and NP-complete cases depending on the choice of H. Moreover, when G is AT-free, chordal or planar, we show that H-Minor Edit is polynomial-time solvable for all graphs H

Superpositions dans les séquences

Manuscript de thèse. Université de Roue

Improving the significance of biological sequences comparison score

Prix du meilleur poster par un doctorant remis par Craig VenterInternational audienc

Canonical decompositions of quasiperiodic words

International audienc

Normal forms of quasiperiodic strings

International audienc

Superpositions dans les séquences

Manuscript de thèse. Université de Roue

Normal forms of quasiperiodic strings

International audienc

Quasiperiodicity and string covering

International audienc

Periods and quasiperiods characterization

International audienc