String matching with preprocessing of text and pattern

DOI10.1007/3-540-54233-7_179MaRDI QIDQ4036609zbMATH OpenFDO

Authors Moni Naor

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54233-7_179

zbMATH Keywords

Lempel Ziv algorithmon-line algorithmsparallel data compressionpreprocessingstring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Distributed algorithms (68W15) Information theory (general) (94A15)

Recommendations

• Faster Parallel String Matching via Larger Deterministic Samples
• String matching in Lempel-Ziv compressed strings
• scientific article; zbMATH DE number 3911754
• scientific article; zbMATH DE number 1263249
• Optimal parallel pattern matching in strings

Cited in

(6)

• On the decisional complexity of problems over the reals
• Adaptive learning of compressible strings
• String matching with lookahead
• Parallelism and dictionary based data compression
• Sublinear time Lempel-Ziv (LZ77) factorization
• New advances in rightmost Lempel-Ziv

This page was built for publication: String matching with preprocessing of text and pattern

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