Faster generation of super condensed neighbourhoods using finite automata

Abstract

We present a new algorithm for generating super condensed neighbourhoods, Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a pattern neigh-bourhood. These sets play an important role in the generation phase of hybrid algorithms for indexed approximate string matching. An existing algorithm for this purpose is based on a dynamic programming approach, implemented using bit-parallelism. In this work we present a bit-parallel algorithm based on automata which is faster, conceptually much simpler and uses less memory than the existing method. © Springer-Verlag Berlin Heidelberg 2005.