UPDF AI

Explaining and Extending the Bit-parallel Approximate String Matching Algorithm of Myers

Heikki Hyyrö

2001
43 citaten

TLDR

This paper derives a practically equivalent version of the algorithm of Myers to allow also a fourth kind of error: transposition of two adjacent cha racters, which has typically been omitted from approximate string matching algorithms.