Real-time streaming string-matching
From MaRDI portal
Recommendations
Cites work
- Efficient randomized pattern-matching algorithms
- Exact and Approximate Pattern Matching in the Streaming Model
- Fast Pattern Matching in Strings
- Optimal parallel algorithms for string matching
- Periodicity in streams
- String Matching in Real Time
- Time-space-optimal string matching
- Uniqueness Theorems for Periodic Functions
Cited in
(20)- Online stochastic pattern matching
- Time-space trade-offs for Lempel-Ziv compressed indexing
- Streaming pattern matching with \(d\) wildcards
- Computing the maximum exponent in a stream
- Towards a real time algorithm for parameterized longest common prefix computation
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Sliding suffix tree
- Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
- Simple real-time constant-space string matching
- Dictionary matching in a stream
- Simple real-time constant-space string matching
- Streaming Pattern Matching with d Wildcards
- Real-time streaming string-matching
- Searching Long Repeats in Streams
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Streaming for aibohphobes: longest palindrome with mismatches
- Combinatorial Pattern Matching
- Searching runs in streams
- The Ehrenfeucht-Silberger problem
- Covers in optimal space
This page was built for publication: Real-time streaming string-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011851)
