✦ LIBER ✦

String Matching in Lempel—Ziv Compressed Strings

✍ Scribed by M. Farach; M. Thorup

Book ID: 105746464
Publisher: Springer
Year: 1998
Tongue: English
Weight: 223 KB
Volume: 20
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest-match string searching for ziv-l

Longest-match string searching for ziv-lempel compression

✍ Timothy Bell; David Kulp 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 888 KB

Redundancy of the Lempel-Ziv string matc

Redundancy of the Lempel-Ziv string matching code

✍ Savari, S.A. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 211 KB

Compression of Low Entropy Strings with

Compression of Low Entropy Strings with Lempel--Ziv Algorithms

✍ Kosaraju, S. Rao; Manzini, Giovanni 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 397 KB

Practical and flexible pattern matching

Practical and flexible pattern matching over Ziv–Lempel compressed text

✍ Gonzalo Navarro; Mathieu Raffinot 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 298 KB

Data Compression Using Adaptive Coding a

Data Compression Using Adaptive Coding and Partial String Matching

✍ Cleary, J.; Witten, I. 📂 Article 📅 1984 🏛 IEEE 🌐 English ⚖ 887 KB

Fastest Pattern Matching in Strings

✍ L. Colussi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given