Practical and optimal string matching K Fredriksson, S Grabowski String Processing and Information Retrieval: 12th International Conference …, 2005 | 84 | 2005 |
Average-optimal single and multiple approximate string matching K Fredriksson, G Navarro Journal of Experimental Algorithmics (JEA) 9, 1.4-es, 2004 | 81 | 2004 |
Average complexity of exact and approximate multiple string matching G Navarro, K Fredriksson Theoretical Computer Science 321 (2-3), 283-290, 2004 | 72 | 2004 |
Efficient parameterized string matching K Fredriksson, M Mozgovoy Information Processing Letters 100 (3), 91-96, 2006 | 68 | 2006 |
Increased bit-parallelism for approximate and multiple string matching H Hyyrö, K Fredriksson, G Navarro Journal of Experimental Algorithmics (JEA) 10, 2.6-es, 2005 | 68* | 2005 |
Fast plagiarism detection system M Mozgovoy, K Fredriksson, D White, M Joy, E Sutinen String Processing and Information Retrieval: 12th International Conference …, 2005 | 67 | 2005 |
Shift-or string matching with super-alphabets K Fredriksson Information Processing Letters 87 (4), 201-204, 2003 | 57 | 2003 |
A rotation invariant filter for two-dimensional string matching K Fredriksson, E Ukkonen Combinatorial Pattern Matching: 9th Annual Symposium, CPM 98 Piscataway, New …, 1998 | 56 | 1998 |
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance K Fredriksson, S Grabowski Information Retrieval 11, 335-357, 2008 | 51 | 2008 |
Average-optimal string matching K Fredriksson, S Grabowski Journal of Discrete Algorithms 7 (4), 579-594, 2009 | 47 | 2009 |
Optimal exact and fast approximate two dimensional pattern matching allowing rotations K Fredriksson, G Navarro, E Ukkonen Combinatorial Pattern Matching: 13th Annual Symposium, CPM 2002 Fukuoka …, 2002 | 42 | 2002 |
Simple compression code supporting random access and fast string matching K Fredriksson, F Nikitin Experimental Algorithms: 6th International Workshop, WEA 2007, Rome, Italy …, 2007 | 35 | 2007 |
Bit-parallel string matching under Hamming distance in O (n⌈ m/w⌉) worst case time S Grabowski, K Fredriksson Information Processing Letters 105 (5), 182-187, 2008 | 33 | 2008 |
Faster string matching with super-alphabets K Fredriksson International Symposium on String Processing and Information Retrieval, 44-57, 2002 | 31 | 2002 |
Faster template matching without FFT K Fredriksson, E Ukkonen Proceedings 2001 International Conference on Image Processing (Cat. No …, 2001 | 27 | 2001 |
Engineering efficient metric indexes K Fredriksson Pattern Recognition Letters 28 (1), 75-84, 2007 | 26 | 2007 |
Combinatorial methods for approximate image matching under translations and rotations K Fredriksson, E Ukkonen Pattern Recognition Letters 20 (11-13), 1249-1258, 1999 | 24 | 1999 |
Flexible music retrieval in sublinear time K Fredriksson, V Mäkinen, G Navarro International Journal of Foundations of Computer Science 17 (06), 1345-1364, 2006 | 22 | 2006 |
Quicker similarity joins in metric spaces K Fredriksson, B Braithwaite International Conference on Similarity Search and Applications, 127-140, 2013 | 21 | 2013 |
Rotation and lighting invariant template matching K Fredriksson, V Mäkinen, G Navarro Information and Computation 205 (7), 1096-1113, 2007 | 21 | 2007 |