{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:54:48Z","timestamp":1776113688883,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319024318","type":"print"},{"value":"9783319024325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_25","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"218-229","source":"Crossref","is-referenced-by-count":24,"title":["Fully-Online Grammar Compression"],"prefix":"10.1007","author":[{"given":"Shirou","family":"Maruyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuo","family":"Tabei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FI-2011-565","volume":"111","author":"F. Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundamenta Informaticae\u00a0111, 313\u2013337 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jda.2012.07.006","volume":"18","author":"K. Goto","year":"2013","unstructured":"Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram mining on slp compressed strings. J. Discrete Algorithms\u00a018, 89\u201399 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR3","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 636\u2013645 (2003)"},{"key":"25_CR4","unstructured":"Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: STACS, pp. 26\u201328 (2009)"},{"key":"25_CR5","unstructured":"Inenaga, S., Bannai, H.: Finding characteristic substrings from compressed texts. In: PSC, pp. 40\u201354 (2009)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"issue":"2","key":"25_CR7","first-page":"172","volume":"4","author":"M. Karpinski","year":"1997","unstructured":"Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nordic J. Comp.\u00a04(2), 172\u2013186 (1997)","journal-title":"Nordic J. Comp."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","volume":"483","author":"S. Kreft","year":"2013","unstructured":"Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theoretical Computer Science\u00a0483, 115\u2013133 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"25_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3390\/a5020214","volume":"5","author":"S. Maruyama","year":"2012","unstructured":"Maruyama, S., Sakamoto, H., Takeda, M.: An online algorithm for lightweight grammar-based compression. Algorithms\u00a05(2), 213\u2013235 (2012)","journal-title":"Algorithms"},{"issue":"8-10","key":"25_CR10","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.tcs.2008.12.016","volume":"410","author":"W. Matsubara","year":"2009","unstructured":"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\u00a0410(8-10), 900\u2013913 (2009)","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., Providel, E.: Fast, small, simple rank\/select on bitmaps. In: Proc. SEA, pp. 295\u2013306 (2012)","DOI":"10.1007\/978-3-642-30850-5_26"},{"key":"25_CR12","unstructured":"Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. ACM Transactions on Algorithms (2010), Accepted A preliminary version appeared in SODA 2010"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Workshop on Algorithm Engineering & Experiments (2007)","DOI":"10.1137\/1.9781611972870.6"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"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\u00a03 (2007)","DOI":"10.1145\/1290672.1290680"},{"issue":"1-3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci.\u00a0302(1-3), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-38905-4_23","volume-title":"Combinatorial Pattern Matching","author":"Y. Tabei","year":"2013","unstructured":"Tabei, Y., Takabatake, Y., Sakamoto, H.: A succinct grammar compression. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 235\u2013246. Springer, Heidelberg (2013)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Takabatake, Y., Tabei, Y., Sakamoto, H.: Variable-length codes for space-efficient grammar-based compression. In: SPIRE, pp. 398\u2013410 (2012)","DOI":"10.1007\/978-3-642-34109-0_42"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-20712-9_32","volume-title":"Computer Science \u2013 Theory and Applications","author":"A. Tiskin","year":"2011","unstructured":"Tiskin, A.: Towards approximate matching in compressed strings: Local subsequence recognition. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 401\u2013414. Springer, Heidelberg (2011)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-21458-5_27","volume-title":"Combinatorial Pattern Matching","author":"T. Yamamoto","year":"2011","unstructured":"Yamamoto, T., Bannai, H., Inenaga, S., Takeda, M.: Faster subsequence and don\u2019t-care pattern matching on compressed texts. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 309\u2013322. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T21:26:54Z","timestamp":1596576414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}