{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:01:50Z","timestamp":1743116510714,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":18,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_81","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"171-174","source":"Crossref","is-referenced-by-count":0,"title":["Compressed Pattern Matching"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Takeda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"81_CR1_81","doi-asserted-by":"crossref","unstructured":"Amir, A., Benson, G.: Efficient two-dimensional compressed matching. In: Proc. Data Compression Conference '92 (DCC'92), pp.\u00a0279 (1992)","DOI":"10.1109\/DCC.1992.227453"},{"issue":"2","key":"81_CR2_81","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/jcss.1996.0023","volume":"52","author":"A. Amir","year":"1996","unstructured":"Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. J.\u00a0Comput. Syst. Sci. 52(2), 299\u2013307 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"81_CR3_81","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jagm.1997.0860","volume":"24","author":"A. Amir","year":"1997","unstructured":"Amir, A., Benson, G., Farach, M.: Optimal two-dimensional compressed matching. J.\u00a0Algorithms 24(2), 354\u2013379 (1997)","journal-title":"J. Algorithms"},{"issue":"3","key":"81_CR4_81","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1016\/S0304-3975(02)00041-5","volume":"290","author":"A. Amir","year":"2003","unstructured":"Amir, A., Landau, G.M., Sokol, D.: Inplace run-length 2d compressed search. Theor. Comput. Sci. 290(3), 1361\u20131383 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"81_CR5_81","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E. de Moura","year":"2000","unstructured":"de\u00a0Moura, E., Navarro, G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst. 18(2), 113\u2013139 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"4","key":"81_CR6_81","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/PL00009202","volume":"20","author":"M. Farach","year":"1998","unstructured":"Farach, M., Thorup, M.: String-matching in Lempel\u2013Ziv compressed strings. Algorithmica 20(4), 388\u2013404 (1998)","journal-title":"Algorithmica"},{"key":"81_CR7_81","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel\u2013Ziv encoding. In: Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT'96). LNCS, vol.\u00a01097, pp.\u00a0392\u2013403 (1996)","DOI":"10.1007\/3-540-61422-2_148"},{"issue":"3\u20134","key":"81_CR8_81","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S1570-8667(03)00032-7","volume":"1","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Navarro, G., Ukkonen, E.: Approximate string matching on Ziv\u2013Lempel compressed text. J.\u00a0Discret. Algorithms 1(3\u20134), 313\u2013338 (2003)","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"81_CR9_81","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(02)00426-7","volume":"298","author":"T. Kida","year":"2003","unstructured":"Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Collage systems: a\u00a0unifying framework for compressed pattern matching. Theor. Comput. Sci. 298(1), 253\u2013272 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"81_CR10_81","first-page":"133","volume":"1","author":"T. Kida","year":"2000","unstructured":"Kida, T., Takeda, M., Shinohara, A., Miyazaki, M., Arikawa, S.: Multiple pattern matching in LZW compressed text. J.\u00a0Discret. Algorithms 1(1), 133\u2013158 (2000)","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"81_CR11_81","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00453-002-1005-2","volume":"35","author":"V. Makinen","year":"2003","unstructured":"Makinen, V., Navarro, G., Ukkonen, E.: Approximate matching of run-length compressed strings. Algorithmica 35(4), 347\u2013369 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"81_CR12_81","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/248625.248639","volume":"15","author":"U. Manber","year":"1997","unstructured":"Manber, U.: A\u00a0text compression scheme that allows fast searching directly in the compressed file. ACM Trans. Inf. Syst. 15(2), 124\u2013136 (1997)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"1","key":"81_CR13_81","first-page":"187","volume":"1","author":"M. Miyazaki","year":"2000","unstructured":"Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. J.\u00a0Discret. Algorithms 1(1), 187\u2013204 (2000)","journal-title":"J. Discret. Algorithms"},{"issue":"5\u20136","key":"81_CR14_81","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S1570-8667(03)00036-4","volume":"1","author":"G. Navarro","year":"2003","unstructured":"Navarro, G.: Regular expression searching on compressed text. J.\u00a0Discret. Algorithms 1(5\u20136), 423\u2013443 (2003)","journal-title":"J. Discret. Algorithms"},{"issue":"12","key":"81_CR15_81","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1002\/spe.663","volume":"35","author":"G. Navarro","year":"2005","unstructured":"Navarro, G., Tarhio, J.: LZgrep: A Boyer\u2013Moore string matching tool for Ziv\u2013Lempel compressed text. Softw. Pract. Exp. 35(12), 1107\u20131130 (2005)","journal-title":"Softw. Pract. Exp."},{"issue":"1\u20133","key":"81_CR16_81","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\u2013Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"81_CR17_81","first-page":"306","volume-title":"Proc. 4th Italian Conference on Algorithms and Complexity (CIAC'00). LNCS, vol. 1767","author":"Y. Shibata","year":"2000","unstructured":"Shibata, Y., Kida, T., Fukamachi, S., Takeda, M., Shinohara, A., Shinohara, T., Arikawa, S.: Speeding up pattern matching by text compression. In: Proc. 4th Italian Conference on Algorithms and Complexity (CIAC'00). LNCS, vol.\u00a01767, pp.\u00a0306\u2013315. Springer, Heidelberg (2000)"},{"key":"81_CR18_81","first-page":"181","volume-title":"Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00). LNCS, vol. 1848","author":"Y. Shibata","year":"2000","unstructured":"Shibata, Y., Matsumoto, T., Takeda, M., Shinohara, A., Arikawa, S.: A Boyer\u2013Moore type algorithm for compressed pattern matching. In: Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00). LNCS, vol.\u00a01848, pp.\u00a0181\u2013194. Springer, Heidelberg (2000)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:40Z","timestamp":1738272760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_81"}},"subtitle":["2003; Kida, Matsumoto, Shibata, Takeda, Shinohara, Arikawa"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_81","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}