Real-Time Streaming String-Matching

DOI10.1007/978-3-642-21458-5_15zbMath1339.68324OpenAlexW54294051MaRDI QIDQ3011851

Dany Breslauer, Zvi Galil

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_15

Mathematics Subject Classification ID

Randomized algorithms (68W20) Algorithms on strings (68W32)

Related Items (13)

Dictionary Matching in a Stream ⋮ Simple real-time constant-space string matching ⋮ Time-space trade-offs for Lempel-Ziv compressed indexing ⋮ Towards a real time algorithm for parameterized longest common prefix computation ⋮ The Ehrenfeucht-Silberger problem ⋮ Simple Real-Time Constant-Space String Matching ⋮ Periodicity in data streams with wildcards ⋮ Searching Long Repeats in Streams ⋮ Unnamed Item ⋮ Tight tradeoffs for real-time approximation of longest palindromes in streams ⋮ Real-Time Streaming Multi-Pattern Search for Constant Alphabet ⋮ Sliding suffix tree ⋮ Computing the maximum exponent in a stream

Cites Work

• Time-space-optimal string matching
• Periodicity in Streams
• Optimal parallel algorithms for string matching
• Efficient randomized pattern-matching algorithms
• String Matching in Real Time
• Fast Pattern Matching in Strings
• Exact and Approximate Pattern Matching in the Streaming Model
• Uniqueness Theorems for Periodic Functions

This page was built for publication: Real-Time Streaming String-Matching