On maximal suffixes and constant-space linear-time versions of KMP algorithm.
From MaRDI portal
Publication:1874422
DOI10.1016/S0304-3975(02)00590-XzbMath1051.68051MaRDI QIDQ1874422
Publication date: 25 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (5)
String matching with simple devices ⋮ Simple real-time constant-space string matching ⋮ A note on a simple computation of the maximal suffix of a string ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Towards optimal packed string matching
Cites Work
- Unnamed Item
- Unnamed Item
- String-matching on ordered alphabets
- The zooming method: A recursive approach to time-space efficient string-matching
- Time-space-optimal string matching
- Squares, cubes, and time-space efficient string searching
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Two-way string-matching
This page was built for publication: On maximal suffixes and constant-space linear-time versions of KMP algorithm.