Tighter Packed Bit-Parallel NFA for Approximate String Matching
From MaRDI portal
Publication:5757239
DOI10.1007/11812128_32zbMATH Open1160.68413OpenAlexW1779917599MaRDI QIDQ5757239FDOQ5757239
Authors: Heikki Hyyrö
Publication date: 6 September 2007
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11812128_32
Recommendations
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
- scientific article; zbMATH DE number 2087055
- Bit-parallel approximate string matching algorithms with transposition
- Increased bit-parallelism for approximate and multiple string matching
- Bit-parallel witnesses and their applications to approximate string matching
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Bit-parallel approximate string matching algorithms with transposition.
- Towards optimal packed string matching
- Tight chip area lower bounds for string matching
- Dynamic programming for reduced NFAs for approximate string and sequence matching.
Cited In (1)
This page was built for publication: Tighter Packed Bit-Parallel NFA for Approximate String Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757239)