Kärkkäinen, Juha - Department of Computer Science, University of Helsinki

• 582206 Models of Computation (Autumn 2009) Exercise 6 (13 16 October)
• International Journal of Foundations of Computer Science # World Scientific Publishing Company
• Better External Memory Suffix Array Construction Roman Dementiev
• 582206 Models of Computation (Autumn 2009) Exercise 1 (811 September)
• 582206 Models of Computation (Autumn 2009) Exercise 2 (1518 September)
• 582206 Models of Computation (Autumn 2009) Exercise 5 (69 October)
• BDDBased Analysis of Gapped qGram Filters # Marc Fontaine 1 , Stefan Burkhardt 2 and Juha Karkkainen 2
• TWO AND HIGHER DIMENSIONAL PATTERN MATCHING IN OPTIMAL EXPECTED TIME \Lambda
• 582206 Laskennan mallit Erilliskoe 10.08.2010. Ratkaisuja
• 3.6. TRIE 67 . Poisto ei kuitenkaan vlttmtt hidastu, koska se ei tarvitse vertailuja.
• Fast BWT in Small Space by Blockwise Suffix Sorting
• Mining for similarities in aligned time series using wavelets Yka Huhtala a , Juha Karkkainen a , Hannu Toivonen a,b
• Johdantoesimerkkin a tarkastelemme
• Merkkijonomenetelmt (kevt 2005) Harjoitus 3
• Department of Computer Science Series of Publications A
• Simple Linear Work Suffix Array Construction Juha Karkkainen and Peter Sanders
• LempelZiv Index for qGrams \Lambda Juha Karkkainen and Erkki Sutinen
• 582206 Models of Computation (Autumn 2009) Additional exercises
• 582206 Models of Computation (Autumn 2009) Exercise 8 (1013 November)
• S S S[i -k . . . i + k]
• Publications RepetitionBased
• 582206 Laskennan mallit (syksy 2009) 2. Kurssikoe 17.12. klo 1619
• 4.5. LOPPUOSATAULUKON MUODOSTAMINEN 91 Algoritmi 4.4.3 LCP-taulukon muodostaminen
• 582206 Laskennan mallit Erilliskoe 10.08.2010 klo 1620 Vastuuhenkilo: Juha Karkkainen
• 582206 Laskennan mallit Erilliskoe 09.04.2010 klo 1620 Vastuuhenkilo: Juha Karkkainen
• Yhteydettomat kieliopit [Sipser luku 2.1] Johdantoesimerkkina tarkastelemme kielta L = { anbman | n > 0, m > 0 }, joka
• 582206 Models of Computation (Autumn 2009) Exercise 7 (3 6 November)
• 582206 Models of Computation (Autumn 2009) Exercise 9 (17 20 November)
• 582206 Models of Computation (Autumn 2009) Exercise 11 (1 4 December)
• 582206 Models of Computation (Autumn 2009) Exercise 12 (811 December)
• 3109 S = S[0 . . . n) = s0s1 sn-1 n
• (n log n) (DP(R) + n log n)
• 7. Full-Text Indexes in External Memory Juha Karkkainen
• Computing the Threshold for q-Gram Filters Juha Karkkainen
• 582206 Models of Computation (Autumn 2009) Exercise 4 (29 September 2 October)
• One-Gapped q-Gram Filters for Levenshtein Distance
• Fast BWT in Small Space by Blockwise Suffix Sorting Juha Karkkainen
• 582206 Models of Computation (Autumn 2009) 1st Exam, 22 October at 9-12
• Fast Lightweight Suffix Array Construction and Stefan Burkhardt1
• q Q Q
• Cache Friendly Burrows-Wheeler Inversion Juha Karkkainen