Faster string matching based on hashing and bit-parallelism
From MaRDI portal
Publication:522976
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
Recommendations
Cites Work
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- The exact online string matching problem: a review of the most recent results
- Efficient variants of the backward-oracle-matching algorithm
- Improved and self-tuned occurrence heuristics
- Tuning BNDM with \(q\)-grams
- Fast exact string matching algorithms
- Alternative algorithms for bit-parallel string matching.
- A simple fast hybrid pattern-matching algorithm
- String matching with lookahead
- Title not available (Why is that?)
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)
