Faster Generation of Super Condensed Neighbourhoods Using Finite Automata

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 neighbourhood. 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.

• Type: Conference
• Year: 2005
• Where: SPIRE
• Authors: Luís M. S. Russo, Arlindo L. Oliveira
• Keywords: Algorithm, Approximate String Matching, SPIRE 2005, Super Condensed Neighbourhoods