Bit-Parallel Witnesses and Their Applications to Approximate String Matching

We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k differences in O(m/wn) time, where w is the width of the computer word. The second one, ABNDM [Navarro and Raffinot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximate searching. ABNDM relies on another algorithm, BPA [Wu and Manber, Comm. ACM, 1992], which makes use of an O(km/wn) time algorithm for its internal workings. BPA is slow but flexible enough to support all operations required by ABNDM. We improve previous ABNDM analyses, showing that it is average-optimal in number of inspected characters, although the overall complexity is higher because of the O(km/w) work done per inspected character. We then show that the faster BPM can be adapted to support all the operations required by ABNDM. This involves extending it to compute edit d...

• Type: Journal
• Year: 2005
• Where: ALGORITHMICA
• Authors: Heikki Hyyrö, Gonzalo Navarro
• Keywords: Algorithm, ALGORITHMICA 2005, Approximate String, Sublinear-time Exact Algorithm