A very fast string matching algorithm based on condensed alphabets
From MaRDI portal
Recommendations
Cites work
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- A fast suffix automata based algorithm for exact online string matching
- Efficient randomized pattern-matching algorithms
- Efficient variants of the backward-oracle-matching algorithm
- Fast and flexible packed string matching
- Fast exact string matching algorithms
- Fast Pattern Matching in Strings
- Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- scientific article; zbMATH DE number 1490002 (Why is no real title available?)
- Improved and self-tuned occurrence heuristics
- Speeding up two string-matching algorithms
- The Complexity of Pattern Matching for a Random String
- The exact online string matching problem: a review of the most recent results
Cited in
(4)
This page was built for publication: A very fast string matching algorithm based on condensed alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830059)