Kimmo Fredriksson

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