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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Baeza-Yates, R., Navarro, G.: Faster Approximate String Matching. Algorithmica 23, 127–158 (1999)
Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings – Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyyrö, H. (2006). Tighter Packed Bit-Parallel NFA for Approximate String Matching. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_32
Download citation
DOI: https://doi.org/10.1007/11812128_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37213-4
Online ISBN: 978-3-540-37214-1
eBook Packages: Computer ScienceComputer Science (R0)