{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:22:38Z","timestamp":1725524558277},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422716"},{"type":"electronic","value":"9783540481942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48194-x_18","type":"book-chapter","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T14:24:31Z","timestamp":1233671071000},"page":"193-206","source":"Crossref","is-referenced-by-count":0,"title":["Multiple Pattern Matching Algorithms on Collage System"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Kida","sequence":"first","affiliation":[]},{"given":"Tetsuya","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. Comm. ACM, 18(6):333\u2013340, 1975.","journal-title":"Comm. ACM"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. Data Compression Conference, page 279, 1992.","DOI":"10.1109\/DCC.1992.227453"},{"key":"18_CR3","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, New York, 1994."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Fraenkel","year":"1998","unstructured":"A.S. Fraenkel and J. Simpson. How many squares can a string contain? J. Combin. Theory Ser. A, 82:112\u2013120, 1998.","journal-title":"J. Combin. Theory Ser. A"},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-56024-6_19","volume-title":"Combinatorial Pattern Matching","author":"L.C.K. Hui","year":"1992","unstructured":"L.C.K. Hui. Color set size problem with application to string matching. In Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science, pages 230\u2013243. Springer-Verlag, 1992."},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-45123-4_18","volume-title":"Proc. 11th Ann. Symp. on Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"2000","unstructured":"J. K\u00e4rkk\u00e4inen, G. Navarro, and E. Ukkonen. Approximate string matching over Ziv-Lempel compressed text. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 195\u2013209. Springer-Verlag, 2000."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. 6th International Symp. on String Processing and Information Retrieval, pages 89\u201396. IEEE Computer Society, 1999.","DOI":"10.1109\/SPIRE.1999.796582"},{"key":"18_CR8","unstructured":"T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. Journal of Discrete Algorithms. to appear (previous version in DCC\u201998 and CPM\u201999)."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. In J.A. Storer and M. Cohn, editors, Proc. Data Compression Conference\u2019 98, pages 103\u2013112. IEEE Computer Society, 1998.","DOI":"10.1109\/DCC.1998.672136"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Comput, 6(2):323\u2013350, 1977.","journal-title":"SIAM J. Comput"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"N.J. Larsson and A. Moffat. Offline dictionary-based compression. In Proc. Data Compression Conference\u2019 99, pages 296\u2013305. IEEE Computer Society, 1999.","DOI":"10.1109\/DCC.1999.755679"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"T. Matsumoto, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Bit-parallel approach to approximate string matching in compressed texts. In Proc. 7th International Symp. on String Processing and Information Retrieval, pages 221\u2013228. IEEE Computer Society, 2000.","DOI":"10.1109\/SPIRE.2000.878198"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Faster approximate string matching over compressed text. In Proc. Data Compression Conference 2001. IEEE Computer Society, 2001. to appear.","DOI":"10.1109\/DCC.2001.917177"},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-48452-3_2","volume-title":"Proc. 10th Ann. Symp. on Combinatorial Pattern Matching","author":"G. Navarro","year":"1999","unstructured":"G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science, pages 14\u201336. Springer-Verlag, 1999."},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45123-4_16","volume-title":"Proc. 11th Ann. Symp. on Combinatorial Pattern Matching","author":"G. Navarro","year":"2000","unstructured":"G. Navarro and J. Tarhio. Boyer-Moore string matching over Ziv-Lempel compressed text. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 166\u2013180.Springer-Verlag, 2000."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"C.G. Nevill-Manning, I.H. Witten, and D.L. Maulsby. Compression by induction of hierarchical grammars. In Proc. Data Compression Conference\u2019 94, pages 244\u2013253. IEEE Press, 1994.","DOI":"10.1109\/DCC.1994.305932"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W. Ruzzo","year":"1980","unstructured":"W. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21(2):218\u2013235, 1980.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"W. Ruzzo","year":"1981","unstructured":"W. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22(3):365\u2013383, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"W. Rytter. Algorithms on compressed strings and arrays. In Proc. 26th Ann. Conf. on Current Trends in Theory and Practice of Infomatics. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-47849-3_3"},{"key":"18_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-46521-9_25","volume-title":"Proc. 4th Italian Conference on Algorithms and Complexity","author":"Y. Shibata","year":"2000","unstructured":"Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa. Speeding up pattern matching by text compression. In Proc. 4th Italian Conference on Algorithms and Complexity, volume 1767 of Lecture Notes in Computer Science, pages 306\u2013315. Springer-Verlag, 2000."},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45123-4_17","volume-title":"Proc. 11th Ann. Symp. on Combinatorial Pattern Matching","author":"Y. Shibata","year":"2000","unstructured":"Y. Shibata, T. Matsumoto, M. Takeda, A. Shinohara, and S. Arikawa. A Boyer-Moore type algorithm for compressed pattern matching. In Proc. 11th Ann. Symp. on Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science, pages 181\u2013194. Springer-Verlag, 2000."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"I. Sudborough","year":"1978","unstructured":"I. Sudborough. On the tape complexity of deterministic context-free languages. Journal of ACM, 25:405\u2013414, 1978.","journal-title":"Journal of ACM"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"M. Takeda, Y. Shibata, T. Matsumoto, T. Kida, A. Shinohara, S. Fukamachi, T. Shinohara, and S. Arikawa. Speeding up string pattern matching by text compression: The dawn of a new era. Transactions of Information Processing Society of Japan, 2001. to appear.","DOI":"10.1007\/3-540-46521-9_25"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48194-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:41:01Z","timestamp":1558107661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48194-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422716","9783540481942"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-48194-x_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}