5 citations · 9 across the 6 of their papers we have counts for
7 papers
Suffix arrays with a twist
Tomasz Kowalski, Szymon Grabowski, Kimmo Fredriksson +1
The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navig…
Geometric Near-neighbor Access Tree (GNAT) revisited
Kimmo Fredriksson
Geometric Near-neighbor Access Tree (GNAT) is a metric space indexing method based on hierarchical hyperplane partitioning of the space. While GNAT is very efficient in proximity s…
Multiple pattern matching revisited
Robert Susik, Szymon Grabowski, Kimmo Fredriksson
We consider the classical exact multiple string matching problem. Our solution is based on -grams combined with pattern superimposition, bit-parallelism and alphabet size reduct…
On a compact encoding of the swap automaton
Kimmo Fredriksson, Emanuele Giaquinta
Given a string of length over an alphabet of size , a swapped version of is a string derived from by a series of local swaps, i.e., swaps of adjacent symbols…
Motif matching using gapped patterns
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski +2
We present new algorithms for the problem of multiple string matching of gapped patterns, where a gapped pattern is a sequence of strings such that there is a gap of fixed length b…
Approximate pattern matching with k-mismatches in packed text
Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
Given strings of length and of length over an alphabet of size , the string matching with -mismatches problem is to find the positions of all the substrings i…
On building minimal automaton for subset matching queries
Kimmo Fredriksson
We address the problem of building an index for a set of strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer…