Department information

 

Juha Kärkkäinen

University researcher Department of Computer Science P. O. Box 68 (Gustaf Hällströmin katu 2 b) FIN-00014 University of Helsinki, FINLAND Phone: +358 9 191 51265; Fax: +358 9 191 51120 Email: Firstname.Lastname(ä->a)@cs.Helsinki.FI Room: B214

Research Interests

• String algorithms
• Algorithms and data structures
• Algorithms on memory hierarchies
• Algorithm libraries
• Algorithm engineering
• Data mining
• Computational biology

Teaching

• 582206 Laskennan mallit, syksy 09
• 582633 Diskreetin optimoinnin harjoitustyö, kevät 09
• 58304101 Seminaari: Muistihierarkia-algoritmit, kevät 09
• 58093-3 Merkkijonomenetelmät (String Processing Algorithms), syksy 08
• 582484 Approximation Algorithms, spring 08
• 582603 Advanced Data Structures, spring 07
• 58093-3 Merkkijonomenetelmät (String Processing Algorithms), kevät 07
• 582484 Algorithm Libraries, spring 06
• 58093-3 Merkkijonomenetelmät (String Processing Algorithms), kevät 05

Publications

Recent publications

• Juha Kärkkäinen, Giovanni Manzini, Simon Puglisi. Permuted Longest-Common-Prefix Array.
  In Proc. 20th Symposium on Combinatorial Pattern Matching (CPM 2009), Springer, 2009, pp. 181-192.
  [Springer]
• Juha Kärkkäinen, Tommi Rantala. Engineering radix sort for strings.
  In Proc. 15th String Processing and Information Retrieval Symposium (SPIRE 2008), Springer, 2008, pp. 3-14.
  [Springer]
• Juha Kärkkäinen, Esko Ukkonen. Multidimensional String Matching.
  In M. Kao (editor), Encyclopedia of Algorithms, Springer, 2008, pp. 559-561.
  [Springer]
• Juha Kärkkäinen. Suffix Array Construction.
  In M. Kao (editor), Encyclopedia of Algorithms, Springer, 2008, pp. 919-921.
  [Springer]
• Roman Dementiev, Juha Kärkkäinen, Jens Mehnert and Peter Sanders. Better external memory suffix array construction.
  In ACM Journal of Experimental Algorithmics, Volume 12, Article 3.4, June 2008.
  [JEA]
• Juha Kärkkäinen. Fast BWT in Small Space by Blockwise Suffix Sorting.
  In Theoretical Computer Science, 387 (3), pp. 249-257, 2007.
  [TCS] [.pdf (preliminary version)]
• Juha Kärkkäinen and Joong Chae Na. Faster Filters for Approximate String Matching.
  In Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX07), SIAM, 2007, pp. 84-90.
  [pdf]
• Juha Kärkkäinen, Peter Sanders and Stefan Burkhardt. Linear work suffix array construction.
  J. ACM, 53 (6), pp. 918-936, 2006.
  [JACM] [.pdf (preliminary version)]

Full list of publications

My publications at DBLP

Software

• Experimental Burrows-Wheeler compressor