Dementiev, R., J. Kärkkäinen, J. Mehnert and P. Sanders: Better External Memory Suffix Array Construction. In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005) SIAM, Philadelphia, USA (2005) 86-97.
localid: C1256428004B93B8-3A3C24F177ACF9B2C1256FAC0057E187-DKMS05
Burkhardt, S. and J. Kärkkäinen: Better Filtering with Gapped q-Grams. In: Fundamenta Informaticae 56, 51-70 (2003).
localid: C1256428004B93B8-97486D0D727E678AC1256D0900521D74-BurkhardtKarkkainen2003
Burkhardt, S. and J. Kärkkäinen: Fast Lightweight Suffix Array Construction and Checking. In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003 Lecture Notes in Computer Science. Springer, Heidelberg, Germany (2003) 55-69.
localid: C1256428004B93B8-3E2B1773D0314EDEC1256E8A002B0F6D-Burkhardt2003
Meyer, U., P. Sanders, J. Sibeyn (Eds.): Full-Text Indexes in External Memory. In: Algorithms for Memory Hierarchies. (Eds.) Meyer, Ulrich;Sanders, Peter;Sibeyn, Jop. Springer, Berlin, Germany (2003) 149-170.
localid: C1256428004B93B8-2055A8CDA4A9084BC1256CE5006F11BC-Karkkainen2003a
Kärkkäinen, J. and P. Sanders: Simple Linear Work Suffix Array Construction. In: Automata, languages and programming : 30th International Colloquium, ICALP 2003 Lecture Notes in Computer Science. Springer, Berlin, Germany (2003) 943-955.
localid: C1256428004B93B8-901BAE3BF9EE93A5C1256D090050B9C2-KarkkainenSanders2003
Kärkkäinen, J.: Computing the threshold for q-gram filters. In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory Lecture Notes in Computer Science. Springer, Berlin, Germany (2002) 348-357.
localid: C1256428004B93B8-BDE5926620208DA2C1256CE5006C7B5E-Karkkainen2002
Burkhardt, S. and J. Kärkkäinen: One-Gapped q-Gram Filters for Levenshtein Distance. In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Lecture Notes in Computer Science. Springer, Berlin, Germany (2002) 225-234.
localid: C1256428004B93B8-E631B996E8179208C1256CA2005D83B6-Burkhardt2002
Burkhardt, S. and J. Kärkkäinen: Better Filtering with Gapped q-Grams. In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, (Eds.) Amir, Amihood; Landau, Gadi. Lecture Notes in Computer Science. Springer, Berlin, Germany (2001) 73-85.
url: http://www.mpi-sb.mpg.de/~stburk/gapped-q.ps
localid: C1256428004B93B8-5165C4C93C02B85DC1256A8F00420FEE-Burkhardt2001
Das, G., R. Fleischer, L. Gasieniec, D. Gunopulos and J. Kärkkäinen: Episode matching. In: Combinatorial pattern matching : 8th annual symposium (CPM-97), (Eds.) Apostolico, Alberto; Hein, Jotun. Lecture Notes in Computer Science. Springer, Berlin, Germany (1997) 12-27.
localid: C1256428004B93B8-AE3FF5F2B9D40A90C12564C300285F0E-Das-et-al97
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.