Abstract
We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions {i1, …, ib} (bookmarks) such that any substring of length l crossing one of the positions can be decompressed in O(l) time. Our solution uses space O((n+b)max{1, log∗ n−log∗ (n/b + b/n)}). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.
Cite
CITATION STYLE
Cording, P. H., Gawrychowski, P., & Weimann, O. (2016). Bookmarks in grammar-compressed strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9954 LNCS, pp. 153–159). Springer Verlag. https://doi.org/10.1007/978-3-319-46049-9_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
