Faster string matching based on hashing and bit-parallelism

DOI10.1016/J.IPL.2017.03.005zbMATH Open1405.68460OpenAlexW2605372187MaRDI QIDQ522976FDOQ522976

Authors 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)

Recommendations

• Fast exact string matching algorithms
• A memetic algorithm to schedule planned maintenance for the national grid
• scientific article; zbMATH DE number 1982175
• Tuning string matching for huge pattern sets
• Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences

Cites Work

• scientific article; zbMATH DE number 1615293 (Why is no real title available?)
• scientific article; zbMATH DE number 1490002 (Why is no real title available?)
• A fast string searching algorithm
• A simple fast hybrid pattern-matching algorithm
• Alternative algorithms for bit-parallel string matching.
• Efficient variants of the backward-oracle-matching algorithm
• Fast Pattern Matching in Strings
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Fast exact string matching algorithms
• Improved and self-tuned occurrence heuristics
• String matching with lookahead
• The exact online string matching problem: a review of the most recent results
• Tuning BNDM with \(q\)-grams

Cited In (6)

• Fast exact string matching algorithms
• Finding Preimages in Full MD5 Faster Than Exhaustive Search
• An aggressive algorithm for multiple string matching
• A memetic algorithm to schedule planned maintenance for the national grid
• Fast and linear-time string matching algorithms based on the distances of \(q\)-gram occurrences
• Single-pattern jumping algorithms

This page was built for publication: Faster string matching based on hashing and bit-parallelism

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