{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:23Z","timestamp":1775281223295,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540632207","type":"print"},{"value":"9783540692140","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63220-4_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:19:00Z","timestamp":1330280340000},"page":"1-11","source":"Crossref","is-referenced-by-count":23,"title":["An improved pattern matching algorithm for strings in terms of straight-line programs"],"prefix":"10.1007","author":[{"given":"Masamichi","family":"Miyazaki","sequence":"first","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"1_CR1","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":"1_CR2","unstructured":"A. Amir and G. Benson. Two-dimensional periodicity and its application. In Proc. 3rd Symposium on Discrete Algorithms, page 440, 1992."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Optimal two-dimensional compressed matching. In Proc. 21st International Colloquium on Automata, Languages and Programming, 1994.","DOI":"10.1007\/3-540-58201-0_70"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/jcss.1996.0023","volume":"52","author":"A. Amir","year":"1996","unstructured":"A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52:299\u2013307, 1996.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0196-6774(92)90003-U","volume":"13","author":"A. Amir","year":"1992","unstructured":"A. Amir, G. M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13(1):2\u201332, 1992.","journal-title":"Journal of Algorithms"},{"key":"1_CR6","unstructured":"T. Eilam-Tsoreff and U. Vishkin. Matching patterns in a string subject to multilinear transformations. In Proc. International Workshop on Sequences, Combinatorics, Compression, Security and Transmission, 1988."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"M. Farach and M. Thorup. String-matching in Lempel-Ziv compressed strings. In 27th ACM STOC, pages 703\u2013713, 1995.","DOI":"10.1145\/225058.225288"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. In Proc. 4th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 392\u2013403. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61422-2_148"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter. Randomized efficient algorithms for compressed strings: the finger-print approach. In Proc. Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 39\u201349. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61258-0_3"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"M. Karpinski, W. Rytter, and A. Shinohara. Pattern-matching for strings with short descriptions. In Proc. Combinatorial Pattern Matching, volume 637 of Lecture Notes in Computer Science, pages 205\u2013214. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60044-2_44"},{"key":"1_CR11","unstructured":"M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing, 1997. (to appear)."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63220-4_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:42:52Z","timestamp":1619559772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63220-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632207","9783540692140"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-63220-4_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}