{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:39:12Z","timestamp":1775281152960,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00041-5","type":"journal-article","created":{"date-parts":[[2003,2,5]],"date-time":"2003-02-05T01:51:53Z","timestamp":1044409913000},"page":"1361-1383","source":"Crossref","is-referenced-by-count":14,"title":["Inplace run-length 2d compressed search"],"prefix":"10.1016","volume":"290","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Dina","family":"Sokol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00041-5_BIB1","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, Efficient two dimensional compressed matching, Proc. Data Compression Conference, Snow Bird, Utah, 1992, pp. 279\u2013288.","DOI":"10.1109\/DCC.1992.227453"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB2","unstructured":"A. Amir, G. Benson, Two-dimensional periodicity and its application, Proc. 3rd Symp. Discrete Algorithms, Orlando, FL, 1992, pp. 440\u2013452."},{"issue":"1","key":"10.1016\/S0304-3975(02)00041-5_BIB3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/S0097539795298321","article-title":"Two-dimensional periodicity and its application","volume":"27","author":"Amir","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00041-5_BIB4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0097539792226321","article-title":"An alphabet independent approach to two dimensional pattern matching","volume":"23","author":"Amir","year":"1994","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(02)00041-5_BIB5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1006\/jagm.1997.0860","article-title":"Optimal two-dimensional compressed matching","volume":"24","author":"Amir","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB6","unstructured":"A. Amir, G. Landau, D. Sokol, Inplace run-length 2nd compressed search, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2000, pp. 817\u2013818."},{"key":"10.1016\/S0304-3975(02)00041-5_BIB7","first-page":"40","article-title":"On the complexity of pattern matching for highly compressed two dimensional texts","volume":"Vol. 1264","author":"Berman","year":"1997"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB8","doi-asserted-by":"crossref","unstructured":"M. Farach, M. Thorup, String matching in lempel-ziv compressed strings, Proc. 27th Annu. ACM Symp. Theory Comput., 1995, pp. 703\u2013712.","DOI":"10.1145\/225058.225288"},{"issue":"5","key":"10.1016\/S0304-3975(02)00041-5_BIB9","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1137\/S0097539792241941","article-title":"Alphabet-independent two-dimensional witness computation","volume":"25","author":"Galil","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00041-5_BIB10","first-page":"39","article-title":"Randomized efficient algorithms for compressed strings","volume":"Vol. 1075","author":"Gasieniec","year":"1996"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB11","series-title":"Computer Architeture","author":"Hennessy","year":"1996"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00041-5_BIB13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(nlogn) algorithm for finding all repetitions in a string","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB14","doi-asserted-by":"crossref","unstructured":"U. Vishkin, Optimal parallel pattern matching in strings, Proc. 12th ICALP, 1985, pp. 91\u2013113.","DOI":"10.1016\/S0019-9958(85)80028-0"},{"key":"10.1016\/S0304-3975(02)00041-5_BIB15","unstructured":"J. Ziv, 1995, Personal communication."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000415?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000415?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:53:36Z","timestamp":1556726016000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000415"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00041-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}