Mathieu Raffinot

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 12

Top Topics

String Matching

Top Venues

J. Comput. Biol.

J. Discrete Algorithms

Publications

Guillaume Blin, Alexandru Popa, Mathieu Raffinot, Raluca Uricaru
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. SPIRE (2023)
Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters
VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. CoRR (2020)
Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro
On the Approximability of the Minimum Weight $t$-partite Clique Problem. J. Graph Algorithms Appl. 24 (3) (2020)
Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. ALGOSENSORS (2020)
Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru
On improving the approximation ratio of the r-shortest common superstring problem. CoRR (2018)
Mathieu Raffinot, Romain Rivière
Optimizing Google Shopping Campaigns Structures With Query-Level Matching. CoRR (2017)
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
Flexible Indexing of Repetitive Collections. CiE (2017)
Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru
On the Shortest Common Superstring of NGS Reads. TAMC (2017)
Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru
A note on the shortest common superstring of NGS reads. CoRR (2016)
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
Practical combinations of repetition-aware data structures. CoRR (2016)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Indexing and querying color sets of images. CoRR (2016)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Indexing and querying color sets of images. Theor. Comput. Sci. 647 (2016)
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
Composite repetition-aware data structures. CoRR (2015)
Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot
Composite Repetition-Aware Data Structures. CPM (2015)
Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
Easy Identification of Generalized Common and Conserved Nested Intervals. J. Comput. Biol. 21 (7) (2014)
Aïda Ouangraoua, Mathieu Raffinot
On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction. J. Comput. Biol. 21 (1) (2014)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Various improvements to text fingerprinting CoRR (2013)
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
Single and Multiple Consecutive Permutation Motif Search. ISAAC (2013)
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
Various improvements to text fingerprinting. J. Discrete Algorithms 22 (2013)
Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu
Easy identification of generalized common nested intervals CoRR (2013)
Djamal Belazzougui, Mathieu Raffinot
Approximate regular expression matching with multi-strings. J. Discrete Algorithms 18 (2013)
Djamal Belazzougui, Mathieu Raffinot
Average Optimal String Matching in Packed Strings. CIAC (2013)
Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
Single and multiple consecutive permutation motif search CoRR (2013)
Aïda Ouangraoua, Mathieu Raffinot
Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract). CPM (2012)
Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26 (2) (2012)
Aïda Ouangraoua, Mathieu Raffinot
Faster and Simpler Minimal Conflicting Set Identification CoRR (2012)
Djamal Belazzougui, Mathieu Raffinot
Approximate Regular Expression Matching with Multi-strings. SPIRE (2011)
Mathieu Raffinot
Consecutive Ones Property Testing: Cut or Swap. CiE (2011)
Mathieu Raffinot
Consecutive ones property testing: cut or swap CoRR (2010)
Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs CoRR (2009)
Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discret. Math. 22 (3) (2008)
Roman Kolpakov, Mathieu Raffinot
New algorithms for text fingerprinting. J. Discrete Algorithms 6 (2) (2008)
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) (2008)
Roman Kolpakov, Mathieu Raffinot
Faster Text Fingerprinting. SPIRE (2008)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A Note On Computing Set Overlap Classes CoRR (2007)
Fabien Coulon, Mathieu Raffinot
Fast algorithms for identifying maximal common connected sets of interval graphs. Discret. Appl. Math. 154 (12) (2006)
Roman Kolpakov, Mathieu Raffinot
New Algorithms for Text Fingerprinting. CPM (2006)
Nadia El-Mabrouk, Mathieu Raffinot, Jean-Eudes Duchesne, Mathieu Lajoie, Nicolas Luc
Approximate Matching of Structured Motifs in Dna Sequences. J. Bioinform. Comput. Biol. 3 (2) (2005)
Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot
Permutations, with Applications to Modular Decomposition of Graphs. ESA (2005)
Gonzalo Navarro, Mathieu Raffinot
New Techniques for Regular Expression Searching. Algorithmica 41 (2) (2005)
Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
An algorithmic view of gene teams. Theor. Comput. Sci. 320 (2-3) (2004)
Gonzalo Navarro, Mathieu Raffinot
Practical and flexible pattern matching over Ziv-Lempel compressed text. J. Discrete Algorithms 2 (3) (2004)
Michel Habib, Christophe Paul, Mathieu Raffinot
Maximal Common Connected Sets of Interval Graphs. CPM (2004)
Nicolas Luc, Jean-Loup Risler, Anne Bergeron, Mathieu Raffinot
Gene teams: a new formalization of gene clusters for comparative genomics. Comput. Biol. Chem. 27 (1) (2003)
Gonzalo Navarro, Mathieu Raffinot
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching. J. Comput. Biol. 10 (6) (2003)
Anne Bergeron, Sylvie Corteel, Mathieu Raffinot
The Algorithmic of Gene Teams. WABI (2002)
Nadia El-Mabrouk, Mathieu Raffinot
Approximate matching of secondary structures. RECOMB (2002)
Lorie Dudoignon, Eric Glémet, Hendrik Cornelis Heus, Mathieu Raffinot
High Similarity Sequence Comparison in Clustering Large Sequence Databases. CSB (2002)
Gonzalo Navarro, Mathieu Raffinot
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. RECOMB (2001)
Gonzalo Navarro, Mathieu Raffinot
Compact DFA Representation for Fast Regular Expression Search. WAE (2001)
Mathieu Raffinot
On maximal repeats in strings. Inf. Process. Lett. 80 (3) (2001)
Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
Efficient Experimental String Matching by Weak Factor Recognition. CPM (2001)
Cyril Allauzen, Mathieu Raffinot
Simple Optimal String Matching Algorithm. J. Algorithms 36 (1) (2000)
Gonzalo Navarro, Mathieu Raffinot
Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. ACM J. Exp. Algorithmics 5 (2000)
Cyril Allauzen, Mathieu Raffinot
Simple Optimal String Matching Algorithm. CPM (2000)
Mathieu Raffinot
Asymptotic Estimation of the Average Number of Terminal States in DAWGs. Discret. Appl. Math. 92 (2-3) (1999)
Gonzalo Navarro, Mathieu Raffinot
Fast Regular Expression Search. WAE (1999)
Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
Factor Oracle: A New Structure for Pattern Matching. SOFSEM (1999)
Gonzalo Navarro, Mathieu Raffinot
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text. CPM (1999)
Gonzalo Navarro, Mathieu Raffinot
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching. CPM (1998)