2009 |
42 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Nested Counters in Bit-Parallel String Matching.
LATA 2009: 338-349 |
2008 |
41 | EE | Kimmo Fredriksson:
Succinct backward-DAWG-matching.
ACM Journal of Experimental Algorithmics 13: (2008) |
40 | EE | Szymon Grabowski,
Kimmo Fredriksson:
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time.
Inf. Process. Lett. 105(5): 182-187 (2008) |
39 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance.
Inf. Retr. 11(4): 335-357 (2008) |
38 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching.
Int. J. Found. Comput. Sci. 19(1): 163-183 (2008) |
2007 |
37 | EE | Kimmo Fredriksson,
Fedor Nikitin:
Simple Compression Code Supporting Random Access and Fast String Matching.
WEA 2007: 203-216 |
36 | EE | Karina Figueroa,
Kimmo Fredriksson:
Simple Space-Time Trade-Offs for AESA.
WEA 2007: 229-241 |
35 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Rotation and lighting invariant template matching.
Inf. Comput. 205(7): 1096-1113 (2007) |
34 | EE | Kimmo Fredriksson:
Engineering efficient metric indexes.
Pattern Recognition Letters 28(1): 75-84 (2007) |
2006 |
33 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes.
SPIRE 2006: 267-278 |
32 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Efficient algorithms for (delta, gamma, alpha)-matching.
Stringology 2006: 29-40 |
31 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching.
WEA 2006: 170-181 |
30 | EE | Kimmo Fredriksson:
On-line Approximate String Matching in Natural Language.
Fundam. Inform. 72(4): 453-466 (2006) |
29 | EE | Kimmo Fredriksson,
Maxim Mozgovoy:
Efficient parameterized string matching.
Inf. Process. Lett. 100(3): 91-96 (2006) |
28 | EE | Kimmo Fredriksson,
Szymon Grabowski:
A general compression algorithm that supports fast searching.
Inf. Process. Lett. 100(6): 226-232 (2006) |
27 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Flexible Music Retrieval in Sublinear Time.
Int. J. Found. Comput. Sci. 17(6): 1345-1364 (2006) |
2005 |
26 | EE | Maxim Mozgovoy,
Kimmo Fredriksson,
Daniel R. White,
Mike Joy,
Erkki Sutinen:
Fast Plagiarism Detection System.
SPIRE 2005: 267-270 |
25 | EE | Kimmo Fredriksson,
Szymon Grabowski:
Practical and Optimal String Matching.
SPIRE 2005: 376-387 |
24 | | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Flexible music retrieval in sublinear time.
Stringology 2005: 174-189 |
23 | EE | Heikki Hyyrö,
Kimmo Fredriksson,
Gonzalo Navarro:
Increased bit-parallelism for approximate and multiple string matching.
ACM Journal of Experimental Algorithmics 10: (2005) |
22 | EE | Kimmo Fredriksson:
Exploiting distance coherence to speed up range queries in metric indexes.
Inf. Process. Lett. 95(1): 287-292 (2005) |
21 | EE | Kimmo Fredriksson,
Gonzalo Navarro,
Esko Ukkonen:
Sequential and indexed two-dimensional combinatorial template matching allowing rotations.
Theor. Comput. Sci. 347(1-2): 239-275 (2005) |
2004 |
20 | EE | Stefan Burkhardt,
Kimmo Fredriksson,
Tuomas Ojamies,
Janne Ravantti,
Esko Ukkonen:
Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps.
3DPVT 2004: 979-986 |
19 | EE | Kimmo Fredriksson,
Gonzalo Navarro:
Improved Single and Multiple Approximate String Matching.
CPM 2004: 457-471 |
18 | EE | Kimmo Fredriksson,
Veli Mäkinen,
Gonzalo Navarro:
Rotation and Lighting Invariant Template Matching.
LATIN 2004: 39-48 |
17 | EE | Kimmo Fredriksson:
Metric Indexes for Approximate String Matching in a Dictionary.
SPIRE 2004: 212-213 |
16 | EE | Heikki Hyyrö,
Kimmo Fredriksson,
Gonzalo Navarro:
Increased Bit-Parallelism for Approximate String Matching.
WEA 2004: 285-298 |
15 | EE | Kimmo Fredriksson,
Gonzalo Navarro:
Average-optimal single and multiple approximate string matching.
ACM Journal of Experimental Algorithmics 9: (2004) |
14 | EE | Kimmo Fredriksson,
Jorma Tarhio:
Efficient String Matching in Huffman Compressed Texts.
Fundam. Inform. 63(1): 1-16 (2004) |
13 | EE | Gonzalo Navarro,
Kimmo Fredriksson:
Average complexity of exact and approximate multiple string matching.
Theor. Comput. Sci. 321(2-3): 283-290 (2004) |
2003 |
12 | EE | Kimmo Fredriksson,
Gonzalo Navarro:
Average-Optimal Multiple Approximate String Matching.
CPM 2003: 109-128 |
11 | EE | Kimmo Fredriksson,
Jorma Tarhio:
Processing of Huffman Compressed Texts with a Super-Alphabet.
SPIRE 2003: 108-121 |
10 | EE | Kimmo Fredriksson:
Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm.
SPIRE 2003: 66-79 |
9 | EE | Kimmo Fredriksson:
Shift-or string matching with super-alphabets.
Inf. Process. Lett. 87(4): 201-204 (2003) |
2002 |
8 | EE | Kimmo Fredriksson,
Gonzalo Navarro,
Esko Ukkonen:
Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.
CPM 2002: 235-248 |
7 | EE | Kimmo Fredriksson:
Faster String Matching with Super-Alphabets.
SPIRE 2002: 44-57 |
2001 |
6 | EE | Kimmo Fredriksson,
Esko Ukkonen:
Faster template matching without FFT.
ICIP (1) 2001: 678-681 |
2000 |
5 | EE | Kimmo Fredriksson,
Gonzalo Navarro,
Esko Ukkonen:
An Index for Two Dimensional String Matching Allowing Rotations.
IFIP TCS 2000: 59-75 |
4 | EE | Kimmo Fredriksson:
Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images.
SPIRE 2000: 105-115 |
3 | EE | Kimmo Fredriksson,
Esko Ukkonen:
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays.
SPIRE 2000: 96-104 |
1999 |
2 | EE | Kimmo Fredriksson,
Esko Ukkonen:
Combinatorial methods for approximate image matching under translations and rotations.
Pattern Recognition Letters 20(11-13): 1249-1258 (1999) |
1998 |
1 | | Kimmo Fredriksson,
Esko Ukkonen:
A Rotation Invariant Filter for Two-Dimensional String Matching.
CPM 1998: 118-125 |