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

DOI10.1016/0304-3975(94)00249-IMaRDI QIDQ1367541zbMATH OpenOpenAlexFDO

Authors Leszek Gąsieniec, Wojciech Plandowski, Wojciech Rytter

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 826052 (Why is no real title available?)
• Factorizing words over an ordered alphabet
• Fast Pattern Matching in Strings
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Time-space-optimal string matching
• Two-way string-matching

Cited in

(7)

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

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)