Simple Real-Time Constant-Space String Matching
From MaRDI portal
Publication:3011852
DOI10.1007/978-3-642-21458-5_16zbMath1339.68325OpenAlexW2173413077MaRDI QIDQ3011852
Filippo Mignosi, Roberto Grossi, Dany Breslauer
Publication date: 29 June 2011
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_16
Related Items
Indeterminate string factorizations and degenerate text transformations ⋮ Finding the leftmost critical factorization on unordered alphabet ⋮ Dictionary Matching in a Stream ⋮ Full-fledged real-time indexing for constant size alphabets ⋮ Online Detection of Repetitions with Backtracking ⋮ Towards optimal packed string matching ⋮ \(k\)-abelian pattern matching ⋮ Generic Algorithms for Factoring Strings ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Longest Lyndon Substring After Edit
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
- 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
