Mathieu Raffinot

Djamal Belazzougui, Mathieu Raffinot: Approximate regular expression matching with multi-strings. J. Discrete Algorithms 18: 14-21 (2013)

Djamal Belazzougui, Mathieu Raffinot: Average Optimal String Matching in Packed Strings. CIAC 2013: 37-48

Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot: Various improvements to text fingerprinting. CoRR abs/1301.3488 (2013)

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette: Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013)

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot: Linear Time Split Decomposition Revisited. SIAM J. Discrete Math. 26(2): 499-514 (2012)

Aïda Ouangraoua, Mathieu Raffinot: Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract). CPM 2012: 41-55

Aïda Ouangraoua, Mathieu Raffinot: Faster and Simpler Minimal Conflicting Set Identification. CoRR abs/1201.5513 (2012)

Mathieu Raffinot: Consecutive Ones Property Testing: Cut or Swap. CiE 2011: 239-249

Djamal Belazzougui, Mathieu Raffinot: Approximate Regular Expression Matching with Multi-strings. SPIRE 2011: 55-66

Mathieu Raffinot: Consecutive ones property testing: cut or swap. CoRR abs/1008.3786 (2010)

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot: A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. CoRR abs/0902.1700 (2009)

Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao: A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008)

Roman Kolpakov, Mathieu Raffinot: New algorithms for text fingerprinting. J. Discrete Algorithms 6(2): 243-255 (2008)

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discrete Math. 22(3): 1022-1039 (2008)

Roman Kolpakov, Mathieu Raffinot: Faster Text Fingerprinting. SPIRE 2008: 15-26

Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao: A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007)

Fabien Coulon, Mathieu Raffinot: Fast algorithms for identifying maximal common connected sets of interval graphs. Discrete Applied Mathematics 154(12): 1709-1721 (2006)

Roman Kolpakov, Mathieu Raffinot: New Algorithms for Text Fingerprinting. CPM 2006: 342-353

Nadia El-Mabrouk, Mathieu Raffinot, Jean-Eudes Duchesne, Mathieu Lajoie, Nicolas Luc: Approximate Matching of Structured Motifs in Dna Sequences. J. Bioinformatics and Computational Biology 3(2): 317-342 (2005)

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ESA 2005: 779-790

Gonzalo Navarro, Mathieu Raffinot: New Techniques for Regular Expression Searching. Algorithmica 41(2): 89-116 (2004)

Gonzalo Navarro, Mathieu Raffinot: Practical and flexible pattern matching over Ziv-Lempel compressed text. J. Discrete Algorithms 2(3): 347-371 (2004)

Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot: An algorithmic view of gene teams. Theor. Comput. Sci. 320(2-3): 395-418 (2004)

Michel Habib, Christophe Paul, Mathieu Raffinot: Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372

Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot: Gene teams: a new formalization of gene clusters for comparative genomics. Computational Biology and Chemistry 27(1): 59-67 (2003)

Gonzalo Navarro, Mathieu Raffinot: Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching. Journal of Computational Biology 10(6): 903-923 (2003)

Gonzalo Navarro, Mathieu Raffinot: Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences. Cambridge University Press 2002, isbn 978-0-521-81307-5, pp. I-X, 1-221

Lorie Dudoignon, Eric Glémet, Hendrik Cornelis Heus, Mathieu Raffinot: High Similarity Sequence Comparison in Clustering Large Sequence Databases. CSB 2002: 228-236

Nadia El-Mabrouk, Mathieu Raffinot: Approximate matching of secondary structures. RECOMB 2002: 156-164

Anne Bergeron, Sylvie Corteel, Mathieu Raffinot: The Algorithmic of Gene Teams. WABI 2002: 464-476

Mathieu Raffinot: On maximal repeats in strings. Inf. Process. Lett. 80(3): 165-169 (2001)

Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot: Efficient Experimental String Matching by Weak Factor Recognition. CPM 2001: 51-72

Gonzalo Navarro, Mathieu Raffinot: Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. RECOMB 2001: 231-240

Gonzalo Navarro, Mathieu Raffinot: Compact DFA Representation for Fast Regular Expression Search. Algorithm Engineering 2001: 1-12

Cyril Allauzen, Mathieu Raffinot: Simple Optimal String Matching Algorithm. J. Algorithms 36(1): 102-116 (2000)

Gonzalo Navarro, Mathieu Raffinot: Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. ACM Journal of Experimental Algorithmics 5: 4 (2000)

Cyril Allauzen, Mathieu Raffinot: Simple Optimal String Matching Algorithm. CPM 2000: 364-374

Mathieu Raffinot: Asymptotic Estimation of the Average Number of Terminal States in DAWGs. Discrete Applied Mathematics 92(2-3): 193-203 (1999)

Gonzalo Navarro, Mathieu Raffinot: A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text. CPM 1999: 14-36

Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot: Factor Oracle: A New Structure for Pattern Matching. SOFSEM 1999: 295-310

Gonzalo Navarro, Mathieu Raffinot: Fast Regular Expression Search. Algorithm Engineering 1999: 198-212

Gonzalo Navarro, Mathieu Raffinot: A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching. CPM 1998: 14-33