Mathieu RAFFINOT

Researcher of the laboratory since September 1, 2005

Permanent places of employment:

CNRS - Section STIC-07, since October 2000.

Current research interests:

Text algorithms, pattern matching, computationnal biology, comparative genomics

Curriculum Vitae in brief

2000-August 2005

CNRS - Laboratoire Genome et Informatique, Evry

1996-1999

Ph.D. in Computer Science, October 1999. University of Marne-la-Vallee. Advisor: Maxime Crochemore

1993-1996

Bachelor and Master degrees at the Ecole Normale Supérieure de Lyon, France.

Recent publications

Book

G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. ISBN 0-521-81307-7.

Articles

A. Bergeron, C. Chauve, F. de Montgolfier and M. Raffinot. Computing common intervals of K permutations, with applications to modular decomposition of graphs Conference version with proofs (Compressed PDF). In ESA'2005

M. Habib and C. Paul and M. Raffinot. Maximal Common Connected Sets of Intervals Graphs. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, number 3109 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.

S. Pasek, A. Bergeron, J.-L. Risler, A. Louis, E. Ollivier, and M. Raffinot. Identification of genomic features using microsyntenies of domains: Domain teams. Genome Research, 15:867-874, 2005 (June).

M.P. Beal, A. Bergeron, S. Corteel, and M. Raffinot. An Algorithmic View of Gene Teams. In Theoretical Computer Science , 320(2-3), pages 955-418, 2004.