Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
From MaRDI portal
Publication:975479
DOI10.1016/j.ipl.2008.05.026zbMath1194.68255OpenAlexW2090921859MaRDI QIDQ975479
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.026
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster approximate string matching
- A subquadratic algorithm for approximate limited expression matching
- Bit-parallel approximate string matching algorithms with transposition
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Experimental and Efficient Algorithms
- Tighter Packed Bit-Parallel NFA for Approximate String Matching
This page was built for publication: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching