default search action
Mathieu Raffinot
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c25]Guillaume Blin
, Alexandru Popa
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. SPIRE 2023: 75-88 - 2020
- [j21]Geoffrey Solano
On the Approximability of the Minimum Weight $t$-partite Clique Problem. J. Graph Algorithms Appl. 24(3): 171-190 (2020) - [c24]Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters:
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. ALGOSENSORS 2020: 45-59 - [i14]Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters:
VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. CoRR abs/2006.03666 (2020)
2010 – 2019
- 2018
- [i13]Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru:
On improving the approximation ratio of the r-shortest common superstring problem. CoRR abs/1805.00060 (2018) - 2017
- [c23]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Flexible Indexing of Repetitive Collections. CiE 2017: 162-174 - [c22]Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru:
On the Shortest Common Superstring of NGS Reads. TAMC 2017: 97-111 - [i12]Mathieu Raffinot, Romain Rivière:
Optimizing Google Shopping Campaigns Structures With Query-Level Matching. CoRR abs/1708.04586 (2017) - 2016
- [j20]Djamal Belazzougui, Roman Kolpakov
Indexing and querying color sets of images. Theor. Comput. Sci. 647: 74-84 (2016) - [i11]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Practical combinations of repetition-aware data structures. CoRR abs/1604.06002 (2016) - [i10]Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru:
A note on the shortest common superstring of NGS reads. CoRR abs/1605.05542 (2016) - [i9]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Indexing and querying color sets of images. CoRR abs/1608.07847 (2016) - 2015
- [c21]Djamal Belazzougui, Fabio Cunial, Travis Gagie
Composite Repetition-Aware Data Structures. CPM 2015: 26-39 - [i8]Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Composite repetition-aware data structures. CoRR abs/1502.05937 (2015) - 2014
- [j19]Aïda Ouangraoua, Mathieu Raffinot:
On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction. J. Comput. Biol. 21(1): 64-79 (2014) - [j18]Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu:
Easy Identification of Generalized Common and Conserved Nested Intervals. J. Comput. Biol. 21(7): 520-533 (2014) - 2013
- [j17]Djamal Belazzougui, Mathieu Raffinot:
Approximate regular expression matching with multi-strings. J. Discrete Algorithms 18: 14-21 (2013) - [j16]Djamal Belazzougui, Roman Kolpakov
Various improvements to text fingerprinting. J. Discrete Algorithms 22: 1-18 (2013) - [c20]Djamal Belazzougui, Mathieu Raffinot:
Average Optimal String Matching in Packed Strings. CIAC 2013: 37-48 - [c19]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and Multiple Consecutive Permutation Motif Search. ISAAC 2013: 66-77 - [i7]Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot:
Various improvements to text fingerprinting. CoRR abs/1301.3488 (2013) - [i6]Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette:
Single and multiple consecutive permutation motif search. CoRR abs/1301.4952 (2013) - [i5]Fabien de Montgolfier, Mathieu Raffinot, Irena Rusu:
Easy identification of generalized common nested intervals. CoRR abs/1305.4747 (2013) - 2012
- [j15]Pierre Charbit
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26(2): 499-514 (2012) - [c18]Aïda Ouangraoua, Mathieu Raffinot:
Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract). CPM 2012: 41-55 - [i4]Aïda Ouangraoua, Mathieu Raffinot:
Faster and Simpler Minimal Conflicting Set Identification. CoRR abs/1201.5513 (2012) - 2011
- [c17]Mathieu Raffinot:
Consecutive Ones Property Testing: Cut or Swap. CiE 2011: 239-249 - [c16]Djamal Belazzougui, Mathieu Raffinot:
Approximate Regular Expression Matching with Multi-strings. SPIRE 2011: 55-66 - 2010
- [i3]Mathieu Raffinot:
Consecutive ones property testing: cut or swap. CoRR abs/1008.3786 (2010)
2000 – 2009
- 2009
- [i2]Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot:
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs. CoRR abs/0902.1700 (2009) - 2008
- [j14]Pierre Charbit
A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008) - [j13]Roman Kolpakov
New algorithms for text fingerprinting. J. Discrete Algorithms 6(2): 243-255 (2008) - [j12]Anne Bergeron
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discret. Math. 22(3): 1022-1039 (2008) - [c15]Roman Kolpakov
Faster Text Fingerprinting. SPIRE 2008: 15-26 - 2007
- [i1]Pierre Charbit, Michel Habib
A Note On Computing Set Overlap Classes. CoRR abs/0711.4573 (2007) - 2006
- [j11]Fabien Coulon, Mathieu Raffinot:
Fast algorithms for identifying maximal common connected sets of interval graphs. Discret. Appl. Math. 154(12): 1709-1721 (2006) - [c14]Roman Kolpakov
New Algorithms for Text Fingerprinting. CPM 2006: 342-353 - 2005
- [j10]Gonzalo Navarro, Mathieu Raffinot:
New Techniques for Regular Expression Searching. Algorithmica 41(2): 89-116 (2005) - [j9]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): 317-342 (2005) - [c13]Anne Bergeron, Cédric Chauve, Fabien de Montgolfier, Mathieu Raffinot:
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. ESA 2005: 779-790 - 2004
- [j8]Gonzalo Navarro, Mathieu Raffinot:
Practical and flexible pattern matching over Ziv-Lempel compressed text. J. Discrete Algorithms 2(3): 347-371 (2004) - [j7]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) - [c12]Michel Habib
Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372 - 2003
- [j6]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): 59-67 (2003) - [j5]Gonzalo Navarro, Mathieu Raffinot:
Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching. J. Comput. Biol. 10(6): 903-923 (2003) - 2002
- [b1]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 - [c11]Lorie Dudoignon, Eric Glémet, Hendrik Cornelis Heus, Mathieu Raffinot:
High Similarity Sequence Comparison in Clustering Large Sequence Databases. CSB 2002: 228-236 - [c10]Nadia El-Mabrouk, Mathieu Raffinot:
Approximate matching of secondary structures. RECOMB 2002: 156-164 - [c9]Anne Bergeron, Sylvie Corteel, Mathieu Raffinot:
The Algorithmic of Gene Teams. WABI 2002: 464-476 - 2001
- [j4]Mathieu Raffinot:
On maximal repeats in strings. Inf. Process. Lett. 80(3): 165-169 (2001) - [c8]Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Efficient Experimental String Matching by Weak Factor Recognition. CPM 2001: 51-72 - [c7]Gonzalo Navarro, Mathieu Raffinot:
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. RECOMB 2001: 231-240 - [c6]Gonzalo Navarro, Mathieu Raffinot:
Compact DFA Representation for Fast Regular Expression Search. WAE 2001: 1-12 - 2000
- [j3]Cyril Allauzen, Mathieu Raffinot:
Simple Optimal String Matching Algorithm. J. Algorithms 36(1): 102-116 (2000) - [j2]Gonzalo Navarro, Mathieu Raffinot:
Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. ACM J. Exp. Algorithmics 5: 4 (2000) - [c5]Cyril Allauzen, Mathieu Raffinot:
Simple Optimal String Matching Algorithm. CPM 2000: 364-374
1990 – 1999
- 1999
- [j1]Mathieu Raffinot:
Asymptotic Estimation of the Average Number of Terminal States in DAWGs. Discret. Appl. Math. 92(2-3): 193-203 (1999) - [c4]Gonzalo Navarro, Mathieu Raffinot:
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text. CPM 1999: 14-36 - [c3]Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Factor Oracle: A New Structure for Pattern Matching. SOFSEM 1999: 295-310 - [c2]Gonzalo Navarro
Fast Regular Expression Search. WAE 1999: 198-212 - 1998
- [c1]Gonzalo Navarro, Mathieu Raffinot:
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching. CPM 1998: 14-33
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: