Linear and efficient string matching algorithms based on weak factor recognition
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 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
(6)- Efficient string matching based on a two-step simulation of the suffix automaton
- The Range Automaton: an efficient approach to text-searching
- A weak approach to suffix automata simulation for exact and approximate string matching
- Improved characters distance sampling for online and offline text searching
- Compact suffix automata representations for searching long patterns
- scientific article; zbMATH DE number 1794216 (Why is no real title available?)
This page was built for publication: Linear and efficient string matching algorithms based on weak factor recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629542)
