Straight-line programs (SLPs) offer powerful text compression by representing a text T[1,u] in terms of a restricted context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present a grammar representation whose size is of the same order of that of a plain SLP representation, and can answer other queries apart from expanding nonterminals. This can be of independent interest. We then extend it to achieve the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(n). We also give byproducts on representing binary relations. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Claude, F., & Navarro, G. (2009). Self-indexed text compression using straight-line programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 235–246). https://doi.org/10.1007/978-3-642-03816-7_21
Mendeley helps you to discover research relevant for your work.