A Rotation Invariant Filter for Two-Dimensional String Matching. - Kimmo Fredriksson; Esko Ukkonen (CPM, 1998)

Combinatorial methods for approximate image matching under translations and rotations. - Kimmo Fredriksson; Esko Ukkonen (Pattern Recognit. Lett., 1999)

An Index for Two Dimensional String Matching Allowing Rotations. - Kimmo Fredriksson; Gonzalo Navarro 001; Esko Ukkonen (IFIP TCS, 2000)

Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images. - Kimmo Fredriksson (SPIRE, 2000)

Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. - Kimmo Fredriksson; Esko Ukkonen (SPIRE, 2000)

Faster template matching without FFT. - Kimmo Fredriksson; Esko Ukkonen (ICIP (1), 2001)

Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. - Kimmo Fredriksson; Gonzalo Navarro 001; Esko Ukkonen (CPM, 2002)

Faster String Matching with Super-Alphabets. - Kimmo Fredriksson (SPIRE, 2002)

Average-Optimal Multiple Approximate String Matching. - Kimmo Fredriksson; Gonzalo Navarro 001 (CPM, 2003)

Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm. - Kimmo Fredriksson (SPIRE, 2003)

Processing of Huffman Compressed Texts with a Super-Alphabet. - Kimmo Fredriksson; Jorma Tarhio (SPIRE, 2003)

Shift-or string matching with super-alphabets. - Kimmo Fredriksson (Inf. Process. Lett., 2003)

Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. - Stefan Burkhardt; Kimmo Fredriksson; Tuomas Ojamies; Janne Ravantti; Esko Ukkonen (3DPVT, 2004)

Improved Single and Multiple Approximate String Matching. - Kimmo Fredriksson; Gonzalo Navarro 001 (CPM, 2004)

Metric Indexes for Approximate String Matching in a Dictionary. - Kimmo Fredriksson (SPIRE, 2004)

Increased Bit-Parallelism for Approximate String Matching. - Heikki Hyyrö; Kimmo Fredriksson; Gonzalo Navarro 001 (WEA, 2004)

Efficient String Matching in Huffman Compressed Texts. - Kimmo Fredriksson; Jorma Tarhio (Fundam. Informaticae, 2004)

Average-optimal single and multiple approximate string matching. - Kimmo Fredriksson; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2004)

Average complexity of exact and approximate multiple string matching. - Gonzalo Navarro 001; Kimmo Fredriksson (Theor. Comput. Sci., 2004)

Practical and Optimal String Matching. - Kimmo Fredriksson; Szymon Grabowski (SPIRE, 2005)

Fast Plagiarism Detection System. - Maxim Mozgovoy; Kimmo Fredriksson; Daniel R. White; Mike Joy; Erkki Sutinen (SPIRE, 2005)

Exploiting distance coherence to speed up range queries in metric indexes. - Kimmo Fredriksson (Inf. Process. Lett., 2005)

Increased bit-parallelism for approximate and multiple string matching. - Heikki Hyyrö; Kimmo Fredriksson; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2005)

Sequential and indexed two-dimensional combinatorial template matching allowing rotations. - Kimmo Fredriksson; Gonzalo Navarro 001; Esko Ukkonen (Theor. Comput. Sci., 2005)

Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. - Kimmo Fredriksson; Szymon Grabowski (SPIRE, 2006)

Efficient algorithms for (delta, gamma, alpha)-matching. - Kimmo Fredriksson; Szymon Grabowski (Stringology, 2006)

Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. - Kimmo Fredriksson; Szymon Grabowski (WEA, 2006)

On-line Approximate String Matching in Natural Language. - Kimmo Fredriksson (Fundam. Informaticae, 2006)

Flexible Music Retrieval in Sublinear Time. - Kimmo Fredriksson; Veli Mäkinen; Gonzalo Navarro 001 (Int. J. Found. Comput. Sci., 2006)

A general compression algorithm that supports fast searching. - Kimmo Fredriksson; Szymon Grabowski (Inf. Process. Lett., 2006)

Efficient parameterized string matching. - Kimmo Fredriksson; Maxim Mozgovoy (Inf. Process. Lett., 2006)

Simple Space-Time Trade-Offs for AESA. - Karina Figueroa 001; Kimmo Fredriksson (WEA, 2007)

Simple Compression Code Supporting Random Access and Fast String Matching. - Kimmo Fredriksson; Fedor Nikitin (WEA, 2007)

Rotation and lighting invariant template matching. - Kimmo Fredriksson; Veli Mäkinen; Gonzalo Navarro 001 (Inf. Comput., 2007)

Engineering efficient metric indexes. - Kimmo Fredriksson (Pattern Recognit. Lett., 2007)

Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching. - Kimmo Fredriksson; Szymon Grabowski (Int. J. Found. Comput. Sci., 2008)

Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. - Szymon Grabowski; Kimmo Fredriksson (Inf. Process. Lett., 2008)

Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. - Kimmo Fredriksson; Szymon Grabowski (Inf. Retr., 2008)

Succinct backward-DAWG-matching. - Kimmo Fredriksson (ACM J. Exp. Algorithmics, 2008)

Fast Convolutions and Their Applications in Approximate String Matching. - Kimmo Fredriksson; Szymon Grabowski (IWOCA, 2009)

Nested Counters in Bit-Parallel String Matching. - Kimmo Fredriksson; Szymon Grabowski (LATA, 2009)

Speeding Up Permutation Based Indexing with Indexing. - Karina Figueroa 001; Kimmo Fredriksson (SISAP, 2009)

Simple Random Access Compression. - Kimmo Fredriksson; Fedor Nikitin (Fundam. Informaticae, 2009)

Average-optimal string matching. - Kimmo Fredriksson; Szymon Grabowski (J. Discrete Algorithms, 2009)

From Nondeterministic Suffix Automaton to Lazy Suffix Tree. - Kimmo Fredriksson (Algorithms and Applications, 2010)

On building minimal automaton for subset matching queries. - Kimmo Fredriksson (Inf. Process. Lett., 2010)

Motif Matching Using Gapped Patterns. - Emanuele Giaquinta; Kimmo Fredriksson; Szymon Grabowski; Esko Ukkonen (IWOCA, 2013)

Quicker Similarity Joins in Metric Spaces. - Kimmo Fredriksson; Billy Braithwaite (SISAP, 2013)

Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. - Kimmo Fredriksson; Szymon Grabowski (Eur. J. Comb., 2013)

Approximate pattern matching with k-mismatches in packed text. - Emanuele Giaquinta; Szymon Grabowski; Kimmo Fredriksson (Inf. Process. Lett., 2013)

Multiple Pattern Matching Revisited. - Robert Susik; Szymon Grabowski; Kimmo Fredriksson (Stringology, 2014)

On a compact encoding of the swap automaton. - Kimmo Fredriksson; Emanuele Giaquinta (Inf. Process. Lett., 2014)

Motif matching using gapped patterns. - Emanuele Giaquinta; Kimmo Fredriksson; Szymon Grabowski; Alexandru I. Tomescu; Esko Ukkonen (Theor. Comput. Sci., 2014)

Quicker range- and k-NN joins in metric spaces. - Kimmo Fredriksson; Billy Braithwaite (Inf. Syst., 2015)

Geometric Near-neighbor Access Tree (GNAT) revisited. - Kimmo Fredriksson (CoRR, 2016)

Suffix arrays with a twist. - Tomasz Marek Kowalski; Szymon Grabowski; Kimmo Fredriksson; Marcin Raniszewski (CoRR, 2016)

Practically efficient array initialization. - Kimmo Fredriksson; Pekka Kilpeläinen (Softw. Pract. Exp., 2016)

Suffix Arrays with a Twist. - Tomasz Marek Kowalski; Szymon Grabowski; Kimmo Fredriksson (Comput. Informatics, 2019)

Revisiting Multiple Pattern Matching. - Robert Susik; Szymon Grabowski; Kimmo Fredriksson (Comput. Informatics, 2019)