Stronger Lempel-Ziv Based Compressed Text Indexing

  title={Stronger Lempel-Ziv Based Compressed Text Indexing},
  author={Diego Arroyuelo and Gonzalo Navarro and Kunihiko Sadakane},
Given a text T[1..u] over an alphabet of size σ, the full-text search problem consists in finding the occ occurrences of a given pattern P[1..m] in T. In indexed text searching we build an index on T to improve the search time, yet increasing the space requirement. The current trend in indexed text searching is that of compressed full-text self-indices, which replace the text with a more space-efficient representation of it, at the same time providing indexed access to the text. Thus, we can… CONTINUE READING


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

Indexing Compressed Text

Encyclopedia of Database Systems • 2009
View 15 Excerpts
Highly Influenced

Structuring labeled trees for optimal succinctness, and beyond

46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) • 2005
View 8 Excerpts
Highly Influenced

Representing Trees of Higher Degree

Algorithmica • 2004
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…