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

DOI10.1016/J.IPL.2008.05.026MaRDI QIDQ975479zbMATH OpenOpenAlexFDO

Authors 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

algorithmsedit distanceapproximate string matchingbit-parallel algorithm

Mathematics Subject Classification ID

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

Recommendations

• Tighter Packed Bit-Parallel NFA for Approximate String Matching
• scientific article; zbMATH DE number 2087055
• Bit-parallel witnesses and their applications to approximate string matching
• Increased bit-parallelism for approximate and multiple string matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming

Cites work

• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• A subquadratic algorithm for approximate limited expression matching
• Bit-parallel approximate string matching algorithms with transposition
• Experimental and Efficient Algorithms
• Faster approximate string matching
• Tighter Packed Bit-Parallel NFA for Approximate String Matching

Cited in

(3)

• Bit-parallel witnesses and their applications to approximate string matching
• Tighter Packed Bit-Parallel NFA for Approximate String Matching
• Run-Length Encoded Nondeterministic KMP and Suffix Automata

This page was built for publication: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975479)