{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:06:53Z","timestamp":1649102813488},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2010]]},"DOI":"10.1587\/transinf.e93.d.219","type":"journal-article","created":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T06:03:04Z","timestamp":1265954584000},"page":"219-226","source":"Crossref","is-referenced-by-count":4,"title":["Context-Sensitive Grammar Transform: Compression and Pattern Matching"],"prefix":"10.1587","volume":"E93-D","author":[{"given":"Shirou","family":"MARUYAMA","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Electrical Engineering, Kyushu University"}]},{"given":"Youhei","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology"}]},{"given":"Hiroshi","family":"SAKAMOTO","sequence":"additional","affiliation":[{"name":"Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology"}]},{"given":"Masayuki","family":"TAKEDA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Electrical Engineering, Kyushu University"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] A. Amir and G. Benson, “Efficient two-dimensional compressed matching,” Proc. Data Compression Conference'92 (DCC'92), p.279, 1992."},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0023"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Arikawa and T. Shinohara, “A run-time efficient realization of Aho-Corasick pattern matching machines,” New Generation Computing, vol.2, no.2, pp.171-186, 1984.","DOI":"10.1007\/BF03037101"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, Cambridge University Press, 2007.","DOI":"10.1017\/CBO9780511546853"},{"issue":"2","key":"6","first-page":"72","volume":"36","year":"1989","ISSN":"http:\/\/id.crossref.org\/issn\/0019-9915","issn-type":"print"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T. Kida, T. Matsumoto, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa, “Collage systems: A unifying framework for compressed pattern matching,” Theor. Comput. Sci., vol.298, no.1, pp.253-272, 2003.","DOI":"10.1016\/S0304-3975(02)00426-7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.841160"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/5.892708"},{"key":"10","unstructured":"[10] M. Lothaire, Combinatorics on Words, Cambridge University Press, 1983."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] U. Manber, “A text compression scheme that allows fast searching directly in the compressed file,” ACM Trans. Inf. Syst., vol.15, no.2, pp.124-136, 1997.","DOI":"10.1145\/248625.248639"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] T. Matsumoto, K. Hagio, and M. Takeda, “A run-time efficient implementation of compressed pattern matching automata,” Proc. 13th International Conference on Implementation and Application of Automata (CIAA'08), pp.201-211, 2008.","DOI":"10.1007\/978-3-540-70844-5_21"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] G. Navarro and M. Raffinot, “Practical and flexible pattern matching over Ziv-Lempel compressed text,” J. Discrete Algorithms, vol.2, no.3, pp.347-371, 2004.","DOI":"10.1016\/j.jda.2003.12.002"},{"key":"14","unstructured":"[14] J. Rautio, J. Tanninen, and J. Tarhio, “String matching with stopper encoding and code splitting,” Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM'02), vol.2373 of LNCS, pp.42-52, 2002."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] W. Rytter, “Application of lempel-ziv factorization to the approximation of grammar-based compression,” Theor. Comput. Sci., vol.302, no.1-3, pp.211-222, 2003.","DOI":"10.1016\/S0304-3975(02)00777-6"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.016"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] H. Sakamoto, S. Maruyama, T. Kida, and S. Shimozono, “A space-saving approximation algorithm for grammar-based compression,” IEICE Trans. Inf. Syst., vol.E92-D, no.2, pp.158-165, Feb. 2009.","DOI":"10.1587\/transinf.E92.D.158"},{"key":"18","unstructured":"[18] Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa, “Speeding up pattern matching by text compression,” Proc. 4th Italian Conference on Algorithms and Complexity (CIAC'00), vol.1767 of LNCS, pp.306-315, 2000."},{"key":"19","unstructured":"[19] Y. Shibata, T. Matsumoto, M. Takeda, A. Shinohara, and S. Arikawa, “A Boyer-Moore type algorithm for compressed pattern matching,” Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00), vol.1848 of LNCS, pp.181-194, 2000."},{"key":"20","unstructured":"[20] E.-H. Yang and D.-K. He, “Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: With context models,” IEEE Trans. Inf. Theory, vol.49, no.11, pp.2874-2894, 2003."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.jstage.jst.go.jp\/article\/transinf\/E93.D\/2\/E93.D_2_219\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T06:22:41Z","timestamp":1619418161000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jstage.jst.go.jp\/article\/transinf\/E93.D\/2\/E93.D_2_219\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.e93.d.219","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}