1 citations · 2 across the 4 of their papers we have counts for
6 papers
Compressed Indexing for Consecutive Occurrences
Paweł Gawrychowski, Garance Gourdel, Tatiana Starikovskaya +1
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient s…
Optimal Square Detection Over General Alphabets
Jonas Ellert, Paweł Gawrychowski, Garance Gourdel
Squares (fragments of the form , for some string ) are arguably the most natural type of repetition in strings. The basic algorithmic question concerning squares is to check…
Pattern matching under DTW distance
Garance Gourdel, Anne Driemel, Pierre Peterlongo +1
In this work, we consider the problem of pattern matching under the dynamic time warping (DTW) distance motivated by potential applications in the analysis of biological data produ…
Approximating longest common substring with mismatches: Theory and practice
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski +1
In the problem of the longest common substring with mismatches we are given two strings and must find the maximal length such that there is a length- substr…
Compressing and Indexing Aligned Readsets
Travis Gagie, Garance Gourdel, Giovanni Manzini
In this paper we show how to use one or more assembled or partially assembled genome as the basis for a compressed full-text index of its readset. Specifically, we build a labelled…
String Periods in the Order-Preserving Model
Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski +3
The order-preserving model (op-model, in short) was introduced quite recently but has already attracted significant attention because of its applications in data analysis. We intro…