Fully-online grammar compression

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8214 LNCS, Issue , 2013, Pages 218-229

  Maruyama, Shirou ^a   Tabei, Yasuo ^b   Sakamoto, Hiroshi ^c   Sadakane, Kunihiko ^d  

^a Preferred Infrastructure Inc   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^d NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

HASH TABLE; INFORMATION-THEORETIC LOWER BOUNDS; INPUT STRING; LOAD FACTORS; ON-LINE SETTING; STRAIGHT LINE PROGRAM; SUBSTRING; WORKING SPACE;

ALGORITHMS;

EID: 84893968050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-02432-5_25     Document Type: Conference Paper

References (19)

1. Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundamenta Informaticae 111, 313-337 (2010)
2. Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram mining on slp compressed strings. J. Discrete Algorithms 18, 89-99 (2013)
3. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 636-645 (2003)
4. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: STACS, pp. 26-28 (2009)
5. Inenaga, S., Bannai, H.: Finding characteristic substrings from compressed texts. In: PSC, pp. 40-54 (2009)
6. Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549-554 (1989)
7. Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nordic J. Comp. 4(2), 172-186 (1997)
8. Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theoretical Computer Science 483, 115-133 (2013)
9. Maruyama, S., Sakamoto, H., Takeda, M.: An online algorithm for lightweight grammar-based compression. Algorithms 5(2), 213-235 (2012)
10. Matsubara, W., Inenaga, S., Ishino, A., Shinohara, A., Nakamura, T., Hashimoto, K.: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theoretical Computer Science 410(8-10), 900-913 (2009)
11. Navarro, G., Providel, E.: Fast, small, simple rank/select on bitmaps. In: Proc. SEA, pp. 295-306 (2012)
12. Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. ACM Transactions on Algorithms (2010), Accepted A preliminary version appeared in SODA 2010
13. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Workshop on Algorithm Engineering & Experiments (2007)
14. Raman, R., Rao, S.S., Raman, V.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3 (2007)
15. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3), 211-222 (2003)
16. Tabei, Y., Takabatake, Y., Sakamoto, H.: A succinct grammar compression. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 235-246. Springer, Heidelberg (2013)
17. Takabatake, Y., Tabei, Y., Sakamoto, H.: Variable-length codes for space-efficient grammar-based compression. In: SPIRE, pp. 398-410 (2012)
18. Tiskin, A.: Towards approximate matching in compressed strings: Local subsequence recognition. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 401-414. Springer, Heidelberg (2011)
19. Yamamoto, T., Bannai, H., Inenaga, S., Takeda, M.: Faster subsequence and don't-care pattern matching on compressed texts. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 309-322. Springer, Heidelberg (2011)