Mathieu Raffinot

From MaRDI portal
Revision as of 23:40, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Mathieu Raffinot to Mathieu Raffinot: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:306718

Available identifiers

zbMath Open raffinot.mathieuMaRDI QIDQ306718

List of research outcomes

PublicationDate of PublicationType
VectorTSP: a traveling salesperson problem with racetrack-like acceleration constraints2021-07-08Paper
On the Approximability of the Minimum Weight $t$-partite Clique Problem2020-09-04Paper
Indexing and querying character sets in one- and two-dimensional words2018-10-11Paper
Flexible indexing of repetitive collections2017-08-04Paper
On the Shortest Common Superstring of NGS Reads2017-05-19Paper
Indexing and querying color sets of images2016-09-01Paper
Composite Repetition-Aware Data Structures2015-08-20Paper
Various improvements to text fingerprinting2014-08-13Paper
Single and Multiple Consecutive Permutation Motif Search2014-01-14Paper
Approximate regular expression matching with multi-strings2013-06-24Paper
Average Optimal String Matching in Packed Strings2013-06-07Paper
Linear Time Split Decomposition Revisited2012-09-12Paper
Faster and Simpler Minimal Conflicting Set Identification2012-08-14Paper
Consecutive Ones Property Testing: Cut or Swap2011-09-09Paper
A note on computing set overlap classes2010-06-09Paper
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs2009-08-20Paper
New algorithms for text fingerprinting2008-08-08Paper
https://portal.mardi4nfdi.de/entity/Q54219042007-10-24Paper
New Algorithms for Text Fingerprinting2007-09-14Paper
Practical and flexible pattern matching over Ziv-Lempel compressed text.2007-04-25Paper
Fast algorithms for identifying maximal common connected sets of interval graphs2006-08-14Paper
Algorithms – ESA 20052006-06-27Paper
Combinatorial Pattern Matching2005-09-07Paper
Fast and flexible string matching by combining bit-parallelism and suffix automata2005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q30247952005-07-04Paper
New techniques for regular expression searching2005-02-21Paper
An algorithmic view of gene teams2004-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44101622003-07-02Paper
https://portal.mardi4nfdi.de/entity/Q47855702003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q45524022002-09-02Paper
On maximal repeats in strings2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q45348782002-06-12Paper
https://portal.mardi4nfdi.de/entity/Q27239662001-07-08Paper
Simple Optimal String Matching Algorithm2000-08-27Paper
https://portal.mardi4nfdi.de/entity/Q44962452000-08-13Paper
Asymptotic estimation of the average number of terminal states in DAWGs2000-02-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mathieu Raffinot