See this document in CiteSeerX!

String Matching in Lempel-Ziv Compressed Strings (1991)  (Make Corrections)  (45 citations)
Martin Farach Mikkel Thorup Rutgers University University of Copenhagen



  Home/Search   Context   Related

 
View or download:
rutgers.edu/pub/far...LZ1Matching.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rutgers.edu/~farach/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: String matching and Compression are two widely studied areas of computer science. The theory of string matching has a long association with compression algorithms. Data structures from string matching can be used to derive fast implementations of many important compression schemes, most notably the Lempel-Ziv (LZ1) algorithm. Intuitively, once a string has been compressed -- and therefore its repetitive nature has been elucidated -- one might be tempted to exploit this knowledge to speed up... (Update)

Cited by:   More
Time/Space Ecient Compressed Pattern Matching - Leszek Asieniec Igor   (Correct)
On Compressing and Indexing Data - Ferragina, Manzini   (Correct)
Practical and Flexible Pattern Matching over Ziv-Lempel.. - Navarro, Raffinot   (Correct)

Active bibliography (related documents):   More   All
0.5:   Off-line Compression by Greedy Textual Substitution - Apostolico, Lonardi (2000)   (Correct)
0.3:   Matchings - Lewenstein (1996)   (Correct)
0.2:   A Unifying Framework for Compressed Pattern Matching - Kida, Shibata, Takeda.. (1999)   (Correct)

Similar documents based on text:   More   All
0.1:   A VLSI Systolic Array Architecture for Lempel-Ziv-Based.. - Bongjin Jung Wayne (1994)   (Correct)
0.1:   Let Sleeping Files Lie: Pattern Matching in.. - Amihood Amir, Gary.. (1994)   (Correct)
0.1:   Definability and Compression - Afrati, Leiß, de Rougemont   (Correct)

Related documents from co-citation:   More   All
25:   A Universal Algorithm for Sequential Data Compression - Ziv, Lempel
24:   Let sleeping files lie: pattern-matching in Zcompressed files - Amir, Benson et al. - 1994
19:   A text compression scheme that allows fast searching directly in the compressed .. - Manber - 1993

BibTeX entry:   (Update)

M. Farach. String matching in Lempel-Ziv compressed strings. In ACM Symposium on the Theory of Computing, 1991. http://citeseer.ist.psu.edu/farach91string.html   More

@inproceedings{ farach95string,
    author = "Martin Farach and Mikkel Thorup",
    title = "String matching in {Lempel-Ziv} compressed strings",
    pages = "703--712",
    year = "1995",
    url = "citeseer.ist.psu.edu/farach91string.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
228   A technique for highperformance data compression (context) - Welch - 1984
183   A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
154   Introduction to Algorithms (context) - Leiserson - 1990
95   Computer Science Press (context) - Storer, methods - 1988
89   Efficient randomized pattern-matching algorithms (context) - Karp, Rabin - 1987
61   Let sleeping files lie: Pattern matching in Zcompressed file.. - Amir, Benson et al. - 1994
49   IEEE Transactions on Information Theory (context) - Lempel, Ziv et al. - 1976
38   Efficient two dimensional compressed matching (context) - Amir, Benson - 1992
27   Optimal two-dimensional compressed matching - Amir, Benson et al. - 1994
12   An efficient algorithm for dynamic text indexing (context) - Gu, Farach et al. - 1994
4   Pattern matching in compressed texts (context) - Kosaraju - 1994
2   Pram algorithms for static dictionary compression (context) - Stauffer, Hirschberg - 1994
1   the entropy estimation of low entropy sources (context) - Kosaraju - 1994



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://athos.rutgers.edu/~farach/):   More
Dynamic Dictionary Matching - Amihood Amir, Martin Farach, Zvi.. (1993)   (Correct)
Efficient Randomized Dictionary Matching Algorithms (Extended.. - Amir, al. (1992)   (Correct)
Optimal Evolutionary Tree Comparison by Sparse Dynamic.. - Farach, Thorup (1994)   (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