Advertisement

Bookmarks in Grammar-Compressed Strings

  • Patrick Hagge CordingEmail author
  • Pawel Gawrychowski
  • Oren Weimann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9954)

Abstract

We consider the problem of storing a grammar of size n compressing a string of size N, and a set of positions \(\{i_1,\ldots ,i_b\}\) (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 ^*(\frac{n}{b} + \frac{b}{n} )\})\). Existing solutions for the bookmarking problem either require more space or a super-constant “kick-off” time to start the decompression.

Keywords

Directed Acyclic Graph Random Access Query Time Parse Tree Compression Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Belazzougui, D., Cording, P.H., Puglisi, S.J., Tabei, Y.: Access, rank, and select in grammar-compressed strings. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 142–154. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  2. 2.
    Belazzougui, D., Gagie, T., Gawrychowski, P., Kärkkäinen, J., Ordónez, A., Puglisi, S.J., Tabei, Y.: Queries on LZ-bounded encodings. In: DCC, pp. 83–92 (2014)Google Scholar
  3. 3.
    Bille, P., Christiansen, A.R., Cording, P.H., Gørtz, I.L.: Finger search in grammar-compressed strings (2015). CoRR arXiv:1507.02853
  4. 4.
    Bille, P., Landau, G.M., Raman, R., Sadakane, K., Satti, S.R., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513–539 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theor. 51(7), 2554–2576 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gagie, T., Gawrychowski, P., Kärkkäinen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 731–742. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  7. 7.
    Gawrychowski, P.: Faster algorithm for computing the edit distance between SLP-compressed strings. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 229–236. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  8. 8.
    Knuth, D.E.: Mathematics and computer science: coping with finiteness. Science (New York, NY) 194(4271), 1235–1242 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Larsson, N.J., Moffat, A.: Off-line dictionary-based compression. In: DCC, vol. 88, no. 11, pp. 1722–1732 (2000)Google Scholar
  10. 10.
    Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Apostolico, A., Hein, J. (eds.) CPM 97. LNCS, vol. 1264, pp. 1–11. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  11. 11.
    Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artif. Intell. Res. (JAIR) 7, 67–82 (1997)zbMATHGoogle Scholar
  12. 12.
    Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1), 211–222 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Welch, T.A.: A technique for high-performance data compression. Computer 6(17), 8–19 (1984)CrossRefGoogle Scholar
  14. 14.
    Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23(3), 337–343 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530–536 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Patrick Hagge Cording
    • 1
    Email author
  • Pawel Gawrychowski
    • 2
  • Oren Weimann
    • 2
  1. 1.Technical University of Denmark, DTU ComputeKongens LyngbyDenmark
  2. 2.University of HaifaHaifaIsrael

Personalised recommendations