Nested Counters in Bit-Parallel String Matching

12 years 6 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism. The recently presented technique of nested counters (Matryoshka counters) [1] is to handle small counters most of the time, and refer to larger counters periodically, when the small counters may get full, to prevent overflow. In this work, we present several non-trivial applications of Matryoshka counters in string matching algorithms, improving their worst- or average-case time complexities. The set of problems comprises (δ, α)-matching, matching with k insertions, episode matching, and matching under Levenshtein distance.
Kimmo Fredriksson, Szymon Grabowski
Added 26 Jul 2010
Updated 26 Jul 2010
Type Conference
Year 2009
Where LATA
Authors Kimmo Fredriksson, Szymon Grabowski
Comments (0)