Faster string matching based on hashing and bit-parallelism

DOI10.1016/j.ipl.2017.03.005zbMath1405.68460OpenAlexW2605372187MaRDI QIDQ522976

Abdulrakeeb M. Al-Ssulami, Hassan I. Mathkour

Publication date: 20 April 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.03.005

zbMATH Keywords

online algorithmsstring matching\(q\)-gram hashing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved and self-tuned occurrence heuristics
• String matching with lookahead
• Fast exact string matching algorithms
• A simple fast hybrid pattern-matching algorithm
• The exact online string matching problem
• A fast string searching algorithm
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• Fast Pattern Matching in Strings
• Tuning BNDM withq-Grams
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• String Processing and Information Retrieval