Conservation of the combinatorial structure in genome

  • Date: 04/03/2007

Cedric Chauve (Simon Fraser University)


University of British Columbia


We investigate the problem of computing an evolution scenario based on
genome rearrangements between two genomes modelized by synteny blocks,
or in mathematical terms, sorting signed permutations by reversals. We
consider the case of scenarios that do not break groups of synteny
blocks that are common to the two considered genomes. We show that this
problem is deeply linked with tools developed inb the theory of modular
decomposition of graphs.

Work in collaboration with Severine Berard (INRA, France), Anne Bergeron (LaCIM, UQAM) and Christophe Paul (CNRS, France)

Other Information: 

Discrete Math Seminar 2007