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

DOI10.1016/J.IPL.2008.05.026zbMATH Open1194.68255OpenAlexW2090921859MaRDI QIDQ975479FDOQ975479

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

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

zbMATH Keywords

algorithmsedit distanceapproximate string matchingbit-parallel algorithm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Faster approximate string matching
• Bit-parallel approximate string matching algorithms with transposition
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• A subquadratic algorithm for approximate limited expression matching
• Experimental and Efficient Algorithms
• 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)