I agree that this site is using cookies. You can find further informations here.
X
Raffinot, Mathieu
20  results:
Articles (Online) X
Search for persons X
?
1

On the Approximability of the Minimum Weight $t$-partite Cl..:

Solano, Geoffrey ; Blin, Guillaume ; Raffinot, Mathieu..
Journal of Graph Algorithms and Applications.  24 (2020)  3 - p. 171-190 , 2020
Link: https://doi.org/10.7155/..
 
?
2

Indexing and querying color sets of images:

Belazzougui, Djamal ; Kolpakov, Roman ; Raffinot, Mathieu
Theoretical Computer Science.  647 (2016)  - p. 74-84 , 2016
Link: https://doi.org/10.1016/..
 
?
3

Approximate regular expression matching with multi-strings:

Belazzougui, Djamal ; Raffinot, Mathieu
Journal of Discrete Algorithms.  18 (2013)  - p. 14-21 , 2013
Link: https://doi.org/10.1016/..
 
?
4

Various improvements to text fingerprinting:

Belazzougui, Djamal ; Kolpakov, Roman ; Raffinot, Mathieu
Journal of Discrete Algorithms.  22 (2013)  - p. 1-18 , 2013
Link: https://doi.org/10.1016/..
 
?
5

Linear Time Split Decomposition Revisited:

Charbit, Pierre ; de Montgolfier, Fabien ; Raffinot, Mathieu
SIAM Journal on Discrete Mathematics.  26 (2012)  2 - p. 499-514 , 2012
Link: https://doi.org/10.1137/..
 
?
6

New algorithms for text fingerprinting:

Kolpakov, Roman ; Raffinot, Mathieu
Journal of Discrete Algorithms.  6 (2008)  2 - p. 243-255 , 2008
Link: https://doi.org/10.1016/..
 
?
7

A note on computing set overlap classes:

Charbit, Pierre ; Habib, Michel ; Limouzy, Vincent...
Information Processing Letters.  108 (2008)  4 - p. 186-191 , 2008
Link: https://doi.org/10.1016/..
 
?
8

Computing Common Intervals of K Permutations, with Applicat..:

Bergeron, Anne ; Chauve, Cedric ; de Montgolfier, Fabien.
SIAM Journal on Discrete Mathematics.  22 (2008)  3 - p. 1022-1039 , 2008
Link: https://doi.org/10.1137/..
 
?
9

Fast algorithms for identifying maximal common connected se..:

Coulon, Fabien ; Raffinot, Mathieu
Discrete Applied Mathematics.  154 (2006)  12 - p. 1709-1721 , 2006
Link: https://doi.org/10.1016/..
 
?
10

Identification of genomic features using microsyntenies of ..:

Pasek, Sophie ; Bergeron, Anne ; Risler, Jean-Loup...
Genome Research.  15 (2005)  6 - p. 867-874 , 2005
Link: https://doi.org/10.1101/..
 
?
11

Practical and flexible pattern matching over Ziv–Lempel com..:

Navarro, Gonzalo ; Raffinot, Mathieu
Journal of Discrete Algorithms.  2 (2004)  3 - p. 347-371 , 2004
Link: https://doi.org/10.1016/..
 
?
12

New Techniques for Regular Expression Searching:

Navarro, Gonzalo ; Raffinot, Mathieu
Algorithmica.  41 (2004)  2 - p. 89-116 , 2004
Link: https://doi.org/10.1007/..
 
?
13

An algorithmic view of gene teams:

Béal, Marie-Pierre ; Bergeron, Anne ; Corteel, Sylvie.
Theoretical Computer Science.  320 (2004)  2-3 - p. 395-418 , 2004
Link: https://doi.org/10.1016/..
 
?
14

Fast and Simple Character Classes and Bounded Gaps Pattern ..:

Navarro, Gonzalo ; Raffinot, Mathieu
Journal of Computational Biology.  10 (2003)  6 - p. 903-923 , 2003
Link: https://doi.org/10.1089/..
 
?
15

Gene teams: a new formalization of gene clusters for compar..:

Luc, Nicolas ; Risler, Jean-Loup ; Bergeron, Anne.
Computational Biology and Chemistry.  27 (2003)  1 - p. 59-67 , 2003
Link: https://doi.org/10.1016/..
 
1-15