Your search returned the following 6 documents:
-
Better Filtering with Gapped q-Grams
Stefan Burkhardt and Juha Kärkkäinen
Fundamenta Informaticae 56 (1-2): 51-70, 2003
-
Fast Lightweight Suffix Array Construction and Checking
Stefan Burkhardt and Juha Kärkkäinen
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, 2003, 55-69
[PDF: Download: cpm03.pdf]
-
Filter Algorithms for Approximate String Matching
Stefan Burkhardt
Doctoral dissertation, Universität des Saarlandes, 2002
-
One-Gapped q-Gram Filters for Levenshtein Distance
Stefan Burkhardt and Juha Kärkkäinen
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, Fukuoka, Japan, 2002, 225-234
-
q-gram Based Database Searching Using a Suffix Array (QUASAR)
Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, and Martin Vingron
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), Lyon, France, April 11-14, 1999, 77-83
-
Better Filtering with Gapped q-Grams
Stefan Burkhardt and Juha Kärkkäinen
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, Jerusalem, Israel, July 2001, 2001, 73-85