[R]

D. Belazzougui, R. Kolpakov, M. Raffinot. Various improvements to text fingerprinting
Submitted.

[R]

M. Raffinot. Consecutive ones property testing: cut or swap
Technical report CoRR abs/1008.3786: (2010) Submitted.

[R]

P. Charbit, F. de Montgolfier and M. Raffinot. A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs
Technical report CoRR abs/0902.1700: (2009) Submitted.

[J]

P. Charbit, M. Habib, V. Limouzy, F. de Montgolfier, M. Raffinot and M. Rao. A Note On Computing Set Overlap Classes
Technical report CoRR abs/0711.4573: (2007) Information Processing Letters 108(4): 186-191 (2008).

[C]

R. Kolpakov and M. Raffinot. Faster Text Fingerprinting.
Manuscript. SPIRE 2008: 15-26.

[J]

R. Kolpakov and M. Raffinot. New Algorithms for Text Fingerprinting.
Extended Abstract (pdf) . In CPM'2006, LNCS 4009, Springer-Verlag.
New journal version (pdf) - improved complexity of the naming algorithm, large rewritting . Journal of Discrete Algorithms 6(2): 243-255 (2008)

[T]

M. Raffinot. Pattern Matching and High Level Comparative Genomics
Manuscript (pdf) . Habilitation dissertation, defended Feb 21, 2006. Technical report of Institut Gaspard-Monge IGM-2006/04.

[J]

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 (Compressed pdf). In 13th Annual European Symposium on Algorithms (ESA), Oct. 2005.
Journal version (pdf). In SIAM J. Discrete Math. 22(3): 1022-1039 (2008).

[C]

F. Coulon and M. Raffinot. Fast Algorithms for Identifying Maximal Common Connected Sets of Interval Graphs
Journal version (Compressed PS). in Discrete Applied Mathematics (DAM), Volume 154, Issue 12, Pages 1709-1721.
First algorithm (on sets of intervals) and alternative approach on tree forests:
article in CompBioNets'2004 (Compressed PS)

[C]

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.
Compressed PDF

[J]

M.P. Béal, A. Bergeron, S. Corteel, and M. Raffinot. An Algorithmic View of Gene Teams. In Theoretical Computer Science , 320(2-3), pages 955-418, 2004.
Compressed PS, The code (language C)
(a preliminary version - without any link to Hopcroft's partitioning framework - appeared in WABI'2002, LNCS 2452, P. 464-476, Springer-Verlag.  Compressed PS)

[R]

A.-T. Gai and M. Habib and C. Paul and M. Raffinot. Identifying Common Connected Components of Graphs.
Technical Report RR-LIRMM 03-016, LIRMM, Université de Montpellier 2, July 2003. Submitted.
Compressed PS

[C]

L. Dudoignon, E. Glemet, H. C. Heus, and M. Raffinot. High Similarity Sequence Comparison in Clustering Large Sequence Databases. In CSB'2002. IEEE Computer Society Press, 2002.
BibTeX entry , Compressed PS

[B]

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. 280 pages.
BibTeX entry, Web page

[C]

N. El-Mabrouk and M. Raffinot. Approximate matching of secondary structures . In Proceedings of the 6th Annual International Conference on Computational Molecular Biology, pages 156-164, 2002.
Journal version submitted.

[C]

G. Navarro and M. Raffinot. Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. In Proceedings of the 5th Annual International Conference on Computational Molecular Biology, pages 231-240, 2001.
BibTeX entry, Compressed PS
Journal version (with approximate matching) submitted.

[C]

G. Navarro and M. Raffinot. Compact DFA representation for fast regular expression search . In Proceedings of the 5th Workshop on Algorithm Engineering , number 2141 in Lecture Notes in Computer Science, pages 1-12, 2001.
BibTeX entry, Compressed P

[C]

C. Allauzen, M. Crochemore, and M. Raffinot. Efficient experimental string matching by weak factor recognition . In Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, number 2089 in Lecture Notes in Computer Science, pages 51-72. Springer-Verlag, Berlin, 2001.
BibTeX entry, Compressed PS

[J]

M. Raffinot. A note on maximal repeats in strings. Information Processing Letters , 83, 2001. 
BibTeX entry, Compressed PS

[J]

G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA) , 5(4), 2000. http://www.jea.acm.org.
BibTeX entry, Compressed PS

[J]

C. Allauzen and M. Raffinot. Simple optimal string matching. Journal of Algorithms , 36:102-116, 2000.
BibTeX entry, Compressed PS

[C]

G. Navarro and M. Raffinot. Fast regular expression search. In Proceedings of the 3rd Workshop on Algorithm Engineering, number 1668 in Lecture Notes in Computer Science, pages 199-213. Springer-Verlag, Berlin, 1999.
BibTeX entry, Compressed PS
Journal version submitted.

[C]

G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, number 1645 in Lecture Notes in Computer Science, pages 14-36. Springer-Verlag, Berlin, 1999.
BibTeX entry, Compressed PS
Journal version submitted.

[T]

M. Raffinot. Structures pour le localisation de motifs. Thèse de doctorat, Université de Marne-la-Vallée, 1999.
BibTeX entry, Compressed PS

[R]

C. Allauzen and M. Raffinot. Factor oracle of a set of words. Technical report 99-11, Institut Gaspard-Monge, Université de Marne-la-Vallée, 1999.
BibTeX entry, Compressed PS

[C]

G. Navarro and M. Raffinot. A bit-parallel approach to suffix automata: Fast extended string matching . In Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, number 1448 in Lecture Notes in Computer Science, pages 14-33. Springer-Verlag, Berlin, 1998.
BibTeX entry, Compressed PS

[C]

M. Raffinot. Asymptotic estimation of the average number of terminal states in dawgs. In R. Baeza-Yates, editor, Proceedings of the 4th South American Workshop on String Processing , pages 140-148, Valparaíso, Chile, 1997. Carleton University Press.
BibTeX entry

[C]

M. Raffinot. On the multi backward dawg matching algorithm (MultiBDM). In R. Baeza-Yates, editor, Proceedings of the 4th South American Workshop on String Processing , pages 149-165, Valparaíso, Chile, 1997. Carleton University Press.
BibTeX entry