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

DOI10.1016/0304-3975(94)00249-IzbMATH Open0888.68049OpenAlexW2003794699MaRDI QIDQ1367541FDOQ1367541

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

Recommendations

• String-matching on ordered alphabets
• Two-dimensional pattern matching in linear time and small space
• Publication:3468609
• scientific article
• scientific article; zbMATH DE number 1615293

zbMATH Keywords

string-matching

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Two-way string-matching
• Factorizing words over an ordered alphabet
• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Time-space-optimal string matching
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Title not available (Why is that?)

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367541)