Kimmo Fredriksson

Publication Activity (10 Years)

Years Active: 1998-2019
Publications (10 Years): 5

Top Topics

Pattern Matching

Similarity Join

Top Venues

Comput. Informatics

Inf. Process. Lett.

Publications

Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson
Suffix Arrays with a Twist. Comput. Informatics 38 (3) (2019)
Robert Susik, Szymon Grabowski, Kimmo Fredriksson
Revisiting Multiple Pattern Matching. Comput. Informatics 38 (4) (2019)
Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin Raniszewski
Suffix arrays with a twist. CoRR (2016)
Kimmo Fredriksson, Pekka Kilpeläinen
Practically efficient array initialization. Softw. Pract. Exp. 46 (4) (2016)
Kimmo Fredriksson
Geometric Near-neighbor Access Tree (GNAT) revisited. CoRR (2016)
Kimmo Fredriksson, Billy Braithwaite
Quicker range- and k-NN joins in metric spaces. Inf. Syst. 52 (2015)
Robert Susik, Szymon Grabowski, Kimmo Fredriksson
Multiple Pattern Matching Revisited. Stringology (2014)
Kimmo Fredriksson, Emanuele Giaquinta
On a compact encoding of the swap automaton. Inf. Process. Lett. 114 (7) (2014)
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
Motif matching using gapped patterns. Theor. Comput. Sci. 548 (2014)
Robert Susik, Szymon Grabowski, Kimmo Fredriksson
Multiple pattern matching revisited. CoRR (2014)
Kimmo Fredriksson, Billy Braithwaite
Quicker Similarity Joins in Metric Spaces. SISAP (2013)
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
Motif matching using gapped patterns. CoRR (2013)
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen
Motif Matching Using Gapped Patterns. IWOCA (2013)
Kimmo Fredriksson, Emanuele Giaquinta
On a compact encoding of the swap automaton. CoRR (2013)
Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. 113 (19-21) (2013)
Kimmo Fredriksson, Szymon Grabowski
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. Eur. J. Comb. 34 (1) (2013)
Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
Approximate pattern matching with k-mismatches in packed text CoRR (2012)
Kimmo Fredriksson
On building minimal automaton for subset matching queries. Inf. Process. Lett. 110 (24) (2010)
Kimmo Fredriksson
From Nondeterministic Suffix Automaton to Lazy Suffix Tree. Algorithms and Applications (2010)
Kimmo Fredriksson
On building minimal automaton for subset matching queries CoRR (2010)
Kimmo Fredriksson, Szymon Grabowski
Average-optimal string matching. J. Discrete Algorithms 7 (4) (2009)
Karina Figueroa, Kimmo Fredriksson
Speeding Up Permutation Based Indexing with Indexing. SISAP (2009)
Kimmo Fredriksson, Fedor Nikitin
Simple Random Access Compression. Fundam. Informaticae 92 (1-2) (2009)
Kimmo Fredriksson, Szymon Grabowski
Fast Convolutions and Their Applications in Approximate String Matching. IWOCA (2009)
Kimmo Fredriksson, Szymon Grabowski
Nested Counters in Bit-Parallel String Matching. LATA (2009)
Kimmo Fredriksson
Succinct backward-DAWG-matching. ACM J. Exp. Algorithmics 13 (2008)
Kimmo Fredriksson, Szymon Grabowski
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11 (4) (2008)
Kimmo Fredriksson, Szymon Grabowski
, alpha)-Matching. Int. J. Found. Comput. Sci. 19 (1) (2008)
Szymon Grabowski, Kimmo Fredriksson
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105 (5) (2008)
Karina Figueroa, Kimmo Fredriksson
Simple Space-Time Trade-Offs for AESA. WEA (2007)
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
Rotation and lighting invariant template matching. Inf. Comput. 205 (7) (2007)
Kimmo Fredriksson
Engineering efficient metric indexes. Pattern Recognit. Lett. 28 (1) (2007)
Kimmo Fredriksson, Fedor Nikitin
Simple Compression Code Supporting Random Access and Fast String Matching. WEA (2007)
Kimmo Fredriksson
On-line Approximate String Matching in Natural Language. Fundam. Informaticae 72 (4) (2006)
Kimmo Fredriksson, Szymon Grabowski
Efficient algorithms for (delta, gamma, alpha)-matching. Stringology (2006)
Kimmo Fredriksson, Szymon Grabowski
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. SPIRE (2006)
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
Flexible Music Retrieval in Sublinear Time. Int. J. Found. Comput. Sci. 17 (6) (2006)
Kimmo Fredriksson, Szymon Grabowski
A general compression algorithm that supports fast searching. Inf. Process. Lett. 100 (6) (2006)
Kimmo Fredriksson, Szymon Grabowski
)-Matching. WEA (2006)
Kimmo Fredriksson, Maxim Mozgovoy
Efficient parameterized string matching. Inf. Process. Lett. 100 (3) (2006)
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
Increased bit-parallelism for approximate and multiple string matching. ACM J. Exp. Algorithmics 10 (2005)
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
Sequential and indexed two-dimensional combinatorial template matching allowing rotations. Theor. Comput. Sci. 347 (1-2) (2005)
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
Flexible music retrieval in sublinear time. Stringology (2005)
Kimmo Fredriksson, Szymon Grabowski
Practical and Optimal String Matching. SPIRE (2005)
Kimmo Fredriksson
Exploiting distance coherence to speed up range queries in metric indexes. Inf. Process. Lett. 95 (1) (2005)
Maxim Mozgovoy, Kimmo Fredriksson, Daniel R. White, Mike Joy, Erkki Sutinen
Fast Plagiarism Detection System. SPIRE (2005)
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
Increased Bit-Parallelism for Approximate String Matching. WEA (2004)
Kimmo Fredriksson, Gonzalo Navarro
Improved Single and Multiple Approximate String Matching. CPM (2004)
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
Rotation and Lighting Invariant Template Matching. LATIN (2004)
Gonzalo Navarro, Kimmo Fredriksson
Average complexity of exact and approximate multiple string matching. Theor. Comput. Sci. 321 (2-3) (2004)
Kimmo Fredriksson, Gonzalo Navarro
Average-optimal single and multiple approximate string matching. ACM J. Exp. Algorithmics 9 (2004)
Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen
Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. 3DPVT (2004)
Kimmo Fredriksson, Jorma Tarhio
Efficient String Matching in Huffman Compressed Texts. Fundam. Informaticae 63 (1) (2004)
Kimmo Fredriksson
Metric Indexes for Approximate String Matching in a Dictionary. SPIRE (2004)
Kimmo Fredriksson, Gonzalo Navarro
Average-Optimal Multiple Approximate String Matching. CPM (2003)
Kimmo Fredriksson
Shift-or string matching with super-alphabets. Inf. Process. Lett. 87 (4) (2003)
Kimmo Fredriksson, Jorma Tarhio
Processing of Huffman Compressed Texts with a Super-Alphabet. SPIRE (2003)
Kimmo Fredriksson
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm. SPIRE (2003)
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. CPM (2002)
Kimmo Fredriksson
Faster String Matching with Super-Alphabets. SPIRE (2002)
Kimmo Fredriksson, Esko Ukkonen
Faster template matching without FFT. ICIP (1) (2001)
Kimmo Fredriksson
Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images. SPIRE (2000)
Kimmo Fredriksson, Esko Ukkonen
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. SPIRE (2000)
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
An Index for Two Dimensional String Matching Allowing Rotations. IFIP TCS (2000)
Kimmo Fredriksson, Esko Ukkonen
Combinatorial methods for approximate image matching under translations and rotations. Pattern Recognit. Lett. 20 (11-13) (1999)
Kimmo Fredriksson, Esko Ukkonen
A Rotation Invariant Filter for Two-Dimensional String Matching. CPM (1998)