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

DOI10.1016/j.ipl.2008.05.026zbMath1194.68255OpenAlexW2090921859MaRDI QIDQ975479

Heikki Hyyrö

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

zbMATH Keywords

algorithmsapproximate string matchingedit distancebit-parallel algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items

Run-Length Encoded Nondeterministic KMP and Suffix Automata

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