Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mathieu Raffinot
2010 – today
- 2013
[j16]Djamal Belazzougui, Mathieu Raffinot: Approximate regular expression matching with multi-strings. J. Discrete Algorithms 18: 14-21 (2013)- [c19]Djamal Belazzougui, Mathieu Raffinot: Average Optimal String Matching in Packed Strings. CIAC 2013: 37-48
- [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, Fabien de Montgolfier, Mathieu Raffinot: Linear Time Split Decomposition Revisited. SIAM J. Discrete 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]
- [c16]Djamal Belazzougui, Mathieu Raffinot: Approximate Regular Expression Matching with Multi-strings. SPIRE 2011: 55-66
- 2010
- [i3]
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, 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)
- [j13]Roman Kolpakov, Mathieu Raffinot: New algorithms for text fingerprinting. J. Discrete Algorithms 6(2): 243-255 (2008)
- [j12]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)
- [c15]
- 2007
- [i1]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)
- 2006
- [j11]Fabien Coulon, Mathieu Raffinot: Fast algorithms for identifying maximal common connected sets of interval graphs. Discrete Applied Mathematics 154(12): 1709-1721 (2006)
- [c14]
- 2005
- [j10]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)
- [c13]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
- 2004
- [j9]Gonzalo Navarro, Mathieu Raffinot: New Techniques for Regular Expression Searching. Algorithmica 41(2): 89-116 (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, Christophe Paul, Mathieu Raffinot: 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. Computational Biology and Chemistry 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. Journal of Computational Biology 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]
- 2001
- [j4]
- [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. Algorithm Engineering 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 Journal of Experimental Algorithmics 5: 4 (2000)
- [c5]
1990 – 1999
- 1999
- [j1]Mathieu Raffinot: Asymptotic Estimation of the Average Number of Terminal States in DAWGs. Discrete Applied Mathematics 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, Mathieu Raffinot: Fast Regular Expression Search. Algorithm Engineering 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:12 CEST by the dblp team