Saving comparisons in the Crochemore-Perrin string-matching algorithm
From MaRDI portal
Publication:1365685
DOI10.1016/0304-3975(95)00068-2zbMath0877.68082OpenAlexW2025795269MaRDI QIDQ1365685
Publication date: 7 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00074535/file/RR-2137.pdf
Related Items (6)
The zooming method: A recursive approach to time-space efficient string-matching ⋮ Simple real-time constant-space string matching ⋮ The Ehrenfeucht-Silberger problem ⋮ Simple Real-Time Constant-Space String Matching ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Constant-space string-matching in sublinear average time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- String-matching cannot be done by a two-head one-way deterministic finite automaton
- Linear-time string-matching using only a fixed number of local storage locations
- Periods in strings
- Correctness and efficiency of pattern matching algorithms
- String-matching on ordered alphabets
- Efficient comparison based string matching
- Three one-way heads cannot do string matching
- Speeding up two string-matching algorithms
- Time-space-optimal string matching
- A fast string searching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- Saving Space in Fast String-Matching
- On the Exact Complexity of String Matching: Lower Bounds
- On the Exact Complexity of String Matching: Upper Bounds
- Fast Pattern Matching in Strings
- Fastest Pattern Matching in Strings
- Two-way string-matching
- k one-way heads cannot do string-matching
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Saving comparisons in the Crochemore-Perrin string-matching algorithm
