Simple real-time constant-space string matching
From MaRDI portal
Publication:390869
DOI10.1016/j.tcs.2012.11.040zbMath1292.68177OpenAlexW2095768814MaRDI QIDQ390869
Roberto Grossi, Filippo Mignosi, Dany Breslauer
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.040
Related Items
Computing minimal and maximal suffixes of a substring ⋮ Approximating LZ77 via Small-Space Multiple-Pattern Matching ⋮ Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams ⋮ Streaming pattern matching with \(d\) wildcards ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\) one-way heads cannot do string-matching
- Linear-time computation of local periods
- Linear-time string-matching using only a fixed number of local storage locations
- String-matching on ordered alphabets
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- The zooming method: A recursive approach to time-space efficient string-matching
- Time-space-optimal string matching
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Squares, cubes, and time-space efficient string searching
- Real-Time Streaming String-Matching
- Factorizing words over an ordered alphabet
- Periodicity in Streams
- Efficient randomized pattern-matching algorithms
- Saving Space in Fast String-Matching
- String Matching in Real Time
- Real-time recognition of substring repetition and reversal
- Fast Pattern Matching in Strings
- Two-way string-matching
- Rotations of Periodic Strings and Short Superstrings
- Jewels of Stringology
- Exact and Approximate Pattern Matching in the Streaming Model
- Combinatorial Pattern Matching
