(Enter summary)
Abstract: . We present a Boyer-Moore approach to string matching over
LZ78 and LZW compressed text. The key idea is that, despite that we
cannot exactly choose which text characters to inspect, we can still use
the characters explicitly represented in those formats to shift the pattern
in the text. We present a basic approach and more advanced ones.
Despite that the theoretical average complexity does not improve because
still all the symbols in the compressed text have to be scanned, we
show... (Update)
Context of citations to this paper: More
.... in compressed text was developed for the compression paradigm of LZ78 [52] and its subsequent variant LZW [50] as described in [30] [44]. A more challenging problem is that of fully compressed pattern matching when both the pattern and text strings are compressed [21]...
Cited by: More
Compressing Distributed Text in Parallel with (s.. - Bonacic, Farina..
(Correct)
Practical and Flexible Pattern Matching over Ziv-Lempel.. - Navarro, Raffinot
(Correct)
Multiple Pattern Matching Algorithms on Collage System - Kida, Matsumoto, Takeda.. (2001)
(Correct)
Similar documents (at the sentence level): More
14.7%: Regular Expression Searching over Ziv-Lempel Compressed Text - Navarro (2001)
(Correct)
8.3%: A General Practical Approach to Pattern Matching over.. - Navarro, Raffinot (1998)
(Correct)
7.3%: Approximate String Matching over Ziv-Lempel Compressed Text - Kärkkäinen, Navarro, Ukkonen (2000)
(Correct)
Active bibliography (related documents): More All
0.5: Text Searching: Theory and Practice - Baeza-Yates, Navarro
(Correct)
0.4: Faster Approximate String Matching over Compressed Text - Navarro, Kida, Takeda..
(Correct)
0.3: Regular Expression Searching on Compressed Text - Navarro
(Correct)
Similar documents based on text: More All
0.6: Indexing Text with Approximate q-grams - Navarro, Sutinen, Tarhio (2000)
(Correct)
0.4: Average Complexity of Exact and Approximate Multiple String .. - Navarro, Fredriksson
(Correct)
0.4: Asymmetry in Ziv/Lempel '78 Parsing - Martin Cohn And
(Correct)
Related documents from co-citation: More All
11: A general practical approach to pattern matching over Ziv-Lempel compressed text
- Navarro, Raffinot - 1998
11: A Universal Algorithm for Sequential Data Compression
- Ziv, Lempel
10: Text compression (context) - Bell, Cleary et al. - 1990
BibTeX entry: (Update)
G. Navarro and J. Tarhio. Boyer-Moore string matching over Ziv-Lempel compressed text. In Proc. CPM'2000, LNCS, 2000. In this same volume. http://citeseer.ist.psu.edu/navarro00boyermoore.html More
@inproceedings{ navarro00boyermoore,
author = "G. Navarro and J. Tarhio",
title = "{Boyer-Moore} String Matching over Ziv-Lempel Compressed Text",
booktitle = "Proceedings of the11th Annual Symposium on Combinatorial Pattern Matching",
number = "1848",
publisher = "Springer-Verlag, Berlin",
address = "Montr{\'e}al, Canada",
editor = "R. Giancarlo and D. Sankoff",
pages = "166--180",
year = "2000",
url = "citeseer.ist.psu.edu/navarro00boyermoore.html" }
Citations (may not include all citations):
458
A universal algorithm for sequential data compression
- Ziv, Lempel - 1977
368
Text Compression (context) - Bell, Cleary et al. - 1990
338
A method for the construction of minimum-redundancy codes (context) - Huffman - 1952
228
A technique for high performance data compression (context) - Welch - 1984
214
A fast string searching algorithm (context) - Boyer, Moore - 1977
204
Oxford University Press (context) - Crochemore, Rytter - 1994
196
Fast text searching allowing errors (context) - Wu, Manber - 1992
61
Let sleeping files lie: Pattern matching in Z-compressed fil..
- Amir, Benson et al. - 1996
61
Agrep -- a fast approximate pattern-matching tool
- Wu, Manber - 1992
56
A very fast substring search algorithm (context) - Sunday - 1990
49
Pattern Matching Algorithms (context) - Apostolico, Galil - 1997
45
String matching in Lempel-Ziv compressed strings
- Farach, Thorup - 1998
38
Efficient two-dimensional compressed matching (context) - Amir, Benson - 1992
36
A text compression scheme that allows fast searching directl..
- Manber - 1997
34
Software Practice and Experience (context) - Horspool, searching - 1980
27
Multiple pattern matching in LZW compressed text
- Kida, Takeda et al. - 1998
25
A general practical approach to pattern matching over Ziv-Le..
- Navarro, Raffinot - 1999
22
A unifying framework for compressed pattern matching
- Kida, Shibata et al. - 1999
19
Shift-And approach to pattern matching in LZW compressed tex..
- Kida, Takeda et al. - 1999
14
Approximate string matching over ziv-lempel compressed text
- Karkkainen, Navarro et al. - 2000
10
Efficient algorithms for Lempel-Ziv encodings (context) - Gasieniec, Karpinksi et al. - 1996
9
Fast and flexible word searching on compressed text (context) - Moura, Navarro et al. - 2000
2
Software Practice and Experience (context) - Peltola, Tarhio et al. - 1997
1
The Simple Optimized Algorithm in Detail Search (context) - Ziv, Lempel et al. - 1978
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcc.uchile.cl/~gnavarro/publ.html): More
A More Precise Solution to Two Problems on Tries - Navarro, Poblete
(Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998)
(Correct)
An Optimal Index for PAT Arrays - Navarro (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC