| TANE: An efficient algorithm for discovering functional and approximate dependencies Y Huhtala, J Kärkkäinen, P Porkka, H Toivonen The computer journal 42 (2), 100-111, 1999 | 685 | 1999 |
| Simple linear work suffix array construction J Kärkkäinen, P Sanders International colloquium on automata, languages, and programming, 943-955, 2003 | 623 | 2003 |
| Linear work suffix array construction J Kärkkäinen, P Sanders, S Burkhardt Journal of the ACM (JACM) 53 (6), 918-936, 2006 | 431 | 2006 |
| Efficient discovery of functional and approximate dependencies using partitions Y Huhtala, J Karkkainen, P Porkka, H Toivonen Proceedings 14th International Conference on Data Engineering, 392-401, 1998 | 241 | 1998 |
| Better filtering with gapped q-grams S Burkhardt, J Kärkkäinen Fundamenta informaticae 56 (1-2), 51-70, 2003 | 205 | 2003 |
| Sparse suffix trees J Kärkkäinen, E Ukkonen International Computing and Combinatorics Conference, 219-230, 1996 | 160 | 1996 |
| Better external memory suffix array construction R Dementiev, J Kärkkäinen, J Mehnert, P Sanders Journal of Experimental Algorithmics (JEA) 12, 1-24, 2008 | 146 | 2008 |
| Fast lightweight suffix array construction and checking S Burkhardt, J Kärkkäinen Annual Symposium on Combinatorial Pattern Matching, 55-69, 2003 | 129 | 2003 |
| Lempel-Ziv parsing and sublinear-size index structures for string matching J Kärkkäinen, E Ukkonen Proc. 3rd South American Workshop on String Processing (WSP'96, 1996 | 122 | 1996 |
| Permuted longest-common-prefix array J Kärkkäinen, G Manzini, SJ Puglisi Annual Symposium on Combinatorial Pattern Matching, 181-192, 2009 | 117 | 2009 |
| Suffix cactus: A cross between suffix tree and suffix array J Kärkkäinen Annual Symposium on Combinatorial Pattern Matching, 191-204, 1995 | 111 | 1995 |
| Fast BWT in small space by blockwise suffix sorting J Kärkkäinen Theoretical Computer Science 387 (3), 249-257, 2007 | 102 | 2007 |
| Episode matching G Das, R Fleischer, L Gasieniec, D Gunopulos, J Kärkkäinen Annual Symposium on Combinatorial Pattern Matching, 12-27, 1997 | 101 | 1997 |
| Mining for similarities in aligned time series using wavelets Y Huhtala, J Karkkainen, HTT Toivonen Data Mining and Knowledge Discovery: Theory, Tools, and Technology 3695, 150-160, 1999 | 86 | 1999 |
| A faster grammar-based self-index T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi International Conference on Language and Automata Theory and Applications …, 2012 | 83 | 2012 |
| Colored range queries and document retrieval T Gagie, J Kärkkäinen, G Navarro, SJ Puglisi Theoretical Computer Science 483, 36-50, 2013 | 72 | 2013 |
| LZ77-based self-indexing with faster pattern matching T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi Latin American Symposium on Theoretical Informatics, 731-742, 2014 | 64 | 2014 |
| Linear time Lempel-Ziv factorization: Simple, fast, small J Kärkkäinen, D Kempa, SJ Puglisi Annual Symposium on Combinatorial Pattern Matching, 189-200, 2013 | 61 | 2013 |
| Versatile succinct representations of the bidirectional burrows-wheeler transform D Belazzougui, F Cunial, J Kärkkäinen, V Mäkinen European Symposium on Algorithms, 133-144, 2013 | 59 | 2013 |
| One-gapped q-gram filters for Levenshtein distance S Burkhardt, J Kärkkäinen Annual Symposium on Combinatorial Pattern Matching, 225-234, 2002 | 57 | 2002 |
