The zooming method: A recursive approach to time-space efficient string-matching
From MaRDI portal
Publication:1367541
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 826052 (Why is no real title available?)
- Factorizing words over an ordered alphabet
- Fast Pattern Matching in Strings
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Time-space-optimal string matching
- Two-way string-matching
Cited in
(7)- Space efficient search for maximal repetitions
- String matching with simple devices
- Simple real-time constant-space string matching
- String-matching on ordered alphabets
- Constant-space string-matching in sublinear average time
- Simple real-time constant-space string matching
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
This page was built for publication: The zooming method: A recursive approach to time-space efficient string-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367541)