Improved pattern-scan-order algorithms for string matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432780 (Why is no real title available?)
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- A fast string searching algorithm
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Average case analysis of the Boyer‐Moore algorithm
- Average running time of the Boyer-Moore-Horspool algorithm
- Correctness and efficiency of pattern matching algorithms
- Designing optimal- and fast-on-average pattern matching algorithms
- Exact analysis of Horspool's and Sunday's pattern matching algorithms with probabilistic arithmetic automata
- Fast Pattern Matching in Strings
- Fastest Pattern Matching in Strings
- Introduction to algorithms.
- Irredundant intervals
- On the Exact Complexity of String Matching: Upper Bounds
- The Complexity of Pattern Matching for a Random String
- The exact online string matching problem: a review of the most recent results
- Tighter Upper Bounds on the Exact Complexity of String Matching
Cited in
(3)
This page was built for publication: Improved pattern-scan-order algorithms for string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784983)