Gonzalo Navarro, Jorma Tarhio  Home/Search
Context Related
| dcc.uchile.cl/~gnavarro...cpm00.2.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcc.uchile.cl/~gnavarro/publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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)
Similar documents based on text: More All
0.8: Regular Expression Searching on Compressed Text - Navarro (Correct)
0.6: Indexing Text with Approximate q-grams - Navarro, Sutinen, Tarhio (2000) (Correct)
0.5: Approximate String Matching over Ziv-Lempel Compressed Text - Kärkkäinen, Navarro, Ukkonen (2000) (Correct)
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
[Article contains additional citations not shown here]
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