Indexing text using the Ziv-Lempel trie

@article{Navarro2004IndexingTU,
  title={Indexing text using the Ziv-Lempel trie},
  author={Gonzalo Navarro},
  journal={J. Discrete Algorithms},
  year={2004},
  volume={2},
  pages={87-114}
}
Let a text of u characters over an alphabet of size be compressible to n symbols by the LZ78 or LZW algorithm. We show that it is possible to build a data structure based on the Ziv-Lempel trie that takes 4n log 2 n(1 + o(1)) bits of space and reports the R occurrences of a pattern of length m in worst case time O(m 2 log(mm) + (m + R) log n). 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

On ompressing and indexing data

P. Ferragina, G. Manzini
Te hni al Report TR-02-01, Dipartamento di Informati a, Univ. of Pisa, • 2002

Spa e eÆ ient suÆx trees

I. Munro, V. Raman, S. Rao
Journal of Algorithms, pages 205{222, • 2001

Compa t suÆx array

V. Makinen
In Pro . 11th Ann. Symp. Combinatorial Pattern Mat hing (CPM'00), • 2000

A

I. Witten
Mo at, and T. Bell. Managing Gigabytes. Morgan Kaufmann Pub lishers, New York, se ond edition, • 1999

Similar Papers

Loading similar papers…