Tighter packed bit-parallel NFA for approximate string matching

Authors:
Heikki Hyyrö
Affiliations:
Department of Computer Sciences, University of Tampere, Finland
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 1
Cited 1

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a length-m pattern P and an error threshold k, the bit-parallel NFA of Baeza-Yates and Navarro uses (m – k)(k + 2) bits of space. In this paper we decrease this to (m – k)(k + 1) by modifying the NFA simulation algorithm. As a side-effect, also the original NFA simulation is slightly improved.