Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Grammar-Based Compressed Indexes

Published 20 Oct 2011 in cs.DS | (1110.4493v1)

Abstract: We introduce the first grammar-compressed representation of a sequence that supports searches in time that depends only logarithmically on the size of the grammar. Given a text T[1..u]T[1..u] that is represented by a (context-free) grammar of nn (terminal and nonterminal) symbols and size NN (measured as the sum of the lengths of the right hands of the rules), a basic grammar-based representation of TT takes Nlg⁡nN\lg n bits of space. Our representation requires 2Nlg⁡n+Nlg⁡u+ϵ nlg⁡n+o(Nlg⁡n)2N\lg n + N\lg u + \epsilon\, n\lg n + o(N\lg n) bits of space, for any 0<ϵ≤10<\epsilon \le 1. It can find the positions of the occocc occurrences of a pattern of length mm in TT in O((m2/ϵ)lg⁡(lg⁡ulg⁡n)+occlg⁡n)O((m^2/\epsilon)\lg (\frac{\lg u}{\lg n}) +occ\lg n) time, and extract any substring of length ℓ\ell of TT in time O(ℓ+hlg⁡(N/h))O(\ell+h\lg(N/h)), where hh is the height of the grammar tree.

Citations (81)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.