{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:17:11Z","timestamp":1743009431640,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662481189"},{"type":"electronic","value":"9783662481196"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48119-6_25","type":"book-chapter","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T07:53:56Z","timestamp":1440402836000},"page":"331-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Ambiguous Patterns on Grammar Compressed String"],"prefix":"10.1007","author":[{"given":"Koji","family":"Maeda","sequence":"first","affiliation":[]},{"given":"Yoshimasa","family":"Takabatake","sequence":"additional","affiliation":[]},{"given":"Yasuo","family":"Tabei","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"issue":"7","key":"25_CR1","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"25_CR2","first-page":"313","volume":"111","author":"F Claude","year":"2011","unstructured":"Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fundam. Inf. 111(3), 313\u2013337 (2011)","journal-title":"Fundam. Inf."},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Trans. Algor. 3(1): Article 2 (2007). doi: 10.1145\/1186810.1186812","DOI":"10.1145\/1186810.1186812"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240\u2013251. Springer, Heidelberg (2012)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-38905-4_17","volume-title":"Combinatorial Pattern Matching","author":"A Je\u017c","year":"2013","unstructured":"Je\u017c, A.: Approximation of grammar-based compression via recompression. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 165\u2013176. Springer, Heidelberg (2013)"},{"issue":"2","key":"25_CR6","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. Comput. 4(2), 172\u2013186 (1997)","journal-title":"Nordic J. Comput."},{"key":"25_CR7","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. Theor. Comput. Sci. 483, 115\u2013133 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"NJ Larsson","year":"2000","unstructured":"Larsson, N.J., Moffat, A.: Offline dictionary-based compression. Proc. IEEE 88(11), 1722\u20131732 (2000)","journal-title":"Proc. IEEE"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.jda.2012.07.009","volume":"18","author":"S Maruyama","year":"2013","unstructured":"Maruyama, S., Nakahara, M., Kishiue, N., Sakamoto, H.: ESP-Index: a compressed index based on edit-sensitive parsing. J. Discrete Algorithms 18, 100\u2013112 (2013)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","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 5(2), 213\u2013235 (2012)","journal-title":"Algorithms"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-02432-5_25","volume-title":"String Processing and Information Retrieval","author":"S Maruyama","year":"2013","unstructured":"Maruyama, S., Tabei, Y., Sakamoto, H., Sadakane, K.: Fully-online grammar compression. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 218\u2013229. Springer, Heidelberg (2013)"},{"key":"25_CR12","first-page":"25","volume":"13","author":"G Navarro","year":"2008","unstructured":"Navarro, G.: Implementing the LZ-index: theory versus practice. ACM J. Exp. Algorithmics 13, 25\u201365 (2008)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1\u20133","key":"25_CR13","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. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"25_CR14","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.jda.2004.08.016","volume":"3","author":"H Sakamoto","year":"2005","unstructured":"Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. J. Discrete Algorithms 3(2\u20134), 416\u2013430 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-319-07959-2_29","volume-title":"Experimental Algorithms","author":"Y Takabatake","year":"2014","unstructured":"Takabatake, Y., Tabei, Y., Sakamoto, H.: Improved ESP-index: a practical self-index for highly repetitive texts. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 338\u2013350. Springer, Heidelberg (2014)"},{"issue":"5","key":"25_CR16","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48119-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T12:06:21Z","timestamp":1628597181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48119-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662481189","9783662481196"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48119-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}