The zooming method: A recursive approach to time-space efficient string-matching

DOI10.1016/0304-3975(94)00249-IzbMath0888.68049OpenAlexW2003794699MaRDI QIDQ1367541

Wojciech Plandowski, Wojciech Rytter, Leszek Gąsieniec

Publication date: 29 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00249-i

zbMATH Keywords

string-matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (6)

On maximal suffixes and constant-space linear-time versions of KMP algorithm. ⋮ String matching with simple devices ⋮ Simple real-time constant-space string matching ⋮ Simple Real-Time Constant-Space String Matching ⋮ Space efficient search for maximal repetitions ⋮ Constant-space string-matching in sublinear average time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Time-space-optimal string matching
• Factorizing words over an ordered alphabet
• Fast Pattern Matching in Strings
• Two-way string-matching

This page was built for publication: The zooming method: A recursive approach to time-space efficient string-matching