CiteSeer.IST Home  Related articles for:  The LZ-index: A Text Index Based on the Ziv-Lempel Trie - Navarro (2003)   (Correct)

Active bibliography (related documents):
3.2:   Indexing Text using the Ziv-Lempel Trie - Navarro (2002)   (Correct)
0.6:   High-Order Entropy-Compressed Text Indexes - Grossi, Gupta, Vitter   (Correct)
0.4:   Compressed Suffix Trees with Full Functionality - Sadakane   (Correct)
0.4:   Advantages of Backward Searching - Efficient Secondary.. - Mäkinen, Navarro..   (Correct)
0.4:   Reducing Space for Index Implementation - Crochemore   (Correct)
0.3:   On Compressing and Indexing Data - Ferragina, Manzini   (Correct)
0.3:   Simple Linear Work Suffix Array Construction - Kärkkäinen, Sanders (2003)   (Correct)
0.3:   Engineering a lightweight suffix array construction.. - Manzini, Ferragina   (Correct)
0.3:   String Processing Algorithms - Inenaga (2003)   (Correct)
0.2:   Compact Routing Tables for Graphs of Bounded Genus (Extended.. - Gavoille, al.   (Correct)
0.2:   A Space and Time Efficient Algorithm for Constructing.. - Lam, Sadakane, Sung, Yiu   (Correct)
0.2:   Two space saving tricks for linear time LCP computation - Manzini (2004)   (Correct)
0.2:   Fast Lightweight Suffix Array Construction and Checking - Burkhardt, Kärkkäinen   (Correct)
0.2:   Motifs in Sequences: Localization and Extraction - Crochemore, Sagot (2000)   (Correct)
0.1:   The Enhanced Suffix Array and Its Applications to Genome.. - Abouelhoda, Kurtz.. (2002)   (Correct)
0.1:   Indexing Compressed Text - He (2003)   (Correct)
0.1:   An Experimental Study of an Opportunistic Index - Ferragina, Manzini (2001)   (Correct)
0.1:   Compact Routing Tables for Graphs of Bounded Genus - Gavoille, Hanusse (1999)   (Correct)
0.1:   Space-Economical Algorithms for Finding Maximal Unique Matches - Hon, Sadakane (2002)   (Correct)
0.1:   Compressed Compact Suffix Arrays - Mäkinen, Navarro   (Correct)

Similar documents based on text:
0.6:   Regular Expression Searching over Ziv-Lempel Compressed Text - Navarro (2001)   (Correct)
0.5:   Approximate String Matching over Ziv-Lempel Compressed Text - Kärkkäinen, Navarro, Ukkonen (2000)   (Correct)
0.5:   A Hybrid Indexing Method for Approximate String Matching - Navarro, Baeza-Yates (2001)   (Correct)
0.4:   A General Practical Approach to Pattern Matching over.. - Navarro, Raffinot (1998)   (Correct)
0.4:   New Models and Algorithms for Multidimensional Approximate .. - Baeza-Yates, Navarro   (Correct)
0.4:   Faster Approximate String Matching over Compressed Text - Navarro, Kida, Takeda..   (Correct)
0.4:   Regular Expression Searching on Compressed Text - Navarro   (Correct)
0.4:   Fast Regular Expression Search - Navarro, Raffinot (1999)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Related documents from co-citation:
2:   Compressed text databases with ecient query algorithms based on the compressed s.. (context) - Sadakane - 2000
2:   Overview of the Third Text REtrieval Conference (context) - Harman - 1995
2:   Opportunistic Data Structures with Applications - Ferragina, Manzini - 2000
2:   Indexing Text using the Ziv-Lempel Trie - Navarro - 2002
2:   An experimental study of an opportunistic index - Ferragina, Manzini - 2001
1:   Repetition-based text indexes (context) - arkk - 1999
1:   Compact sux array (context) - akinen - 2000
1:   Compact Pat Tree (context) - Clark - 1996
1:   Succinct Static Data Structures (context) - Jacobson - 1989
1:   Space-ecient static trees and graphs (context) - Jacobson - 1989
1:   Succint representation of balanced parentheses (context) - Munro, Raman - 1997
1:   An analysis of the Burrows-Wheeler transform - Manzini - 1999
1:   Linear pattern matching algorithms (context) - Weiner - 1973
1:   A space and time ecient algorithm for constructing compressed sux arrays (context) - Lam, Sadakane et al. - 2002
1:   arrays: A new method for on-line string searches (context) - Manber, Myers - 1993
1:   Succint representations of lcp information and improvements in the compressed su.. (context) - Sadakane - 2002
1:   A technique for high-performance data compression (context) - Welch - 1984
1:   Compression of low entropy strings with Lempel-Ziv algorithms (context) - Kosaraju, Manzini - 1997
1:   Compression of individual sequences via variable-rate coding - Ziv, Lempel
1:   Adding compression to block addressing inverted indexes - Navarro, Moura et al. - 2000

CiteSeer.IST - Copyright Penn State and NEC