Mathieu Raffinot

According to our database, Mathieu Raffinot authored at least 51 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.

Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru

Proceedings of the String Processing and Information Retrieval, 2023

2020

On the Approximability of the Minimum Weight $t$-partite Clique Problem.

Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro

J. Graph Algorithms Appl., 2020

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints.

Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters

Proceedings of the Algorithms for Sensor Systems, 2020

2018

On improving the approximation ratio of the r-shortest common superstring problem.

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru

CoRR, 2018

2017

Optimizing Google Shopping Campaigns Structures With Query-Level Matching.

Mathieu Raffinot, Romain Rivière

CoRR, 2017

On the Shortest Common Superstring of NGS Reads.

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru

Proceedings of the Theory and Applications of Models of Computation, 2017

Flexible Indexing of Repetitive Collections.

Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

Indexing and querying color sets of images.

Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot

Theor. Comput. Sci., 2016

A note on the shortest common superstring of NGS reads.

Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru

CoRR, 2016

Practical combinations of repetition-aware data structures.

Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot

CoRR, 2016

2015

Composite Repetition-Aware Data Structures.

Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction.

Aïda Ouangraoua, Mathieu Raffinot

J. Comput. Biol., 2014

Easy Identification of Generalized Common and Conserved Nested Intervals.

Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu

J. Comput. Biol., 2014

2013

Approximate regular expression matching with multi-strings.

Djamal Belazzougui, Mathieu Raffinot

J. Discrete Algorithms, 2013

Various improvements to text fingerprinting.

Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot

J. Discrete Algorithms, 2013

Easy identification of generalized common nested intervals

Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu

CoRR, 2013

Single and Multiple Consecutive Permutation Motif Search.

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Average Optimal String Matching in Packed Strings.

Djamal Belazzougui, Mathieu Raffinot

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Linear Time Split Decomposition Revisited.

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot

SIAM J. Discret. Math., 2012

Faster and Simpler Minimal Conflicting Set Identification

Aïda Ouangraoua, Mathieu Raffinot

CoRR, 2012

Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract).

Aïda Ouangraoua, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Consecutive Ones Property Testing: Cut or Swap.

Mathieu Raffinot

Proceedings of the Models of Computation in Context, 2011

2009

A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot

CoRR, 2009

2008

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs.

Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot

SIAM J. Discret. Math., 2008

New algorithms for text fingerprinting.

Roman Kolpakov, Mathieu Raffinot

J. Discrete Algorithms, 2008

A note on computing set overlap classes.

Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao

Inf. Process. Lett., 2008

Faster Text Fingerprinting.

Roman Kolpakov, Mathieu Raffinot

Proceedings of the String Processing and Information Retrieval, 2008

2006

Fast algorithms for identifying maximal common connected sets of interval graphs.

Fabien Coulon, Mathieu Raffinot

Discret. Appl. Math., 2006

2005

Approximate Matching of Structured Motifs in Dna Sequences.

Nadia El-Mabrouk, Mathieu Raffinot, Jean-Eudes Duchesne, Mathieu Lajoie, Nicolas Luc

J. Bioinform. Comput. Biol., 2005

New Techniques for Regular Expression Searching.

Gonzalo Navarro, Mathieu Raffinot

Algorithmica, 2005

Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs.

Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot

Proceedings of the Algorithms, 2005

2004

An algorithmic view of gene teams.

Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot

Theor. Comput. Sci., 2004

Practical and flexible pattern matching over Ziv-Lempel compressed text.

Gonzalo Navarro, Mathieu Raffinot

J. Discrete Algorithms, 2004

Maximal Common Connected Sets of Interval Graphs.

Michel Habib, Christophe Paul, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching.

Gonzalo Navarro, Mathieu Raffinot

J. Comput. Biol., 2003

Gene teams: a new formalization of gene clusters for comparative genomics.

Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot

Comput. Biol. Chem., 2003

2002

The Algorithmic of Gene Teams.

Anne Bergeron, Sylvie Corteel, Mathieu Raffinot

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Approximate matching of secondary structures.

Nadia El-Mabrouk, Mathieu Raffinot

Proceedings of the Sixth Annual International Conference on Computational Biology, 2002

High Similarity Sequence Comparison in Clustering Large Sequence Databases.

Lorie Dudoignon, Eric Glémet, Hendrik Cornelis Heus, Mathieu Raffinot

Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences.

Gonzalo Navarro, Mathieu Raffinot

Cambridge University Press, ISBN: 978-0-521-81307-5, 2002

2001

On maximal repeats in strings.

Mathieu Raffinot

Inf. Process. Lett., 2001

Compact DFA Representation for Fast Regular Expression Search.

Gonzalo Navarro, Mathieu Raffinot

Proceedings of the Algorithm Engineering, 2001

Fast and simple character classes and bounded gaps pattern matching, with application to protein searching.

Gonzalo Navarro, Mathieu Raffinot

Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Efficient Experimental String Matching by Weak Factor Recognition.

Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000

Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata.

Gonzalo Navarro, Mathieu Raffinot

ACM J. Exp. Algorithmics, 2000

Simple Optimal String Matching Algorithm.

Cyril Allauzen, Mathieu Raffinot

J. Algorithms, 2000

1999

Asymptotic Estimation of the Average Number of Terminal States in DAWGs.

Mathieu Raffinot

Discret. Appl. Math., 1999

Fast Regular Expression Search.

Gonzalo Navarro, Mathieu Raffinot

Proceedings of the Algorithm Engineering, 1999

Factor Oracle: A New Structure for Pattern Matching.

Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.

Gonzalo Navarro, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1998

A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching.

Gonzalo Navarro, Mathieu Raffinot

Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998