{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:42:44Z","timestamp":1649090564978},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"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":[[1993,2]]},"DOI":"10.1016\/0304-3975(93)90197-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"331-344","source":"Crossref","is-referenced-by-count":0,"title":["Efficient CRCW-PRAM algorithms for universal substring searching"],"prefix":"10.1016","volume":"108","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90197-2_BIB1","series-title":"Handbook of Theoretical Computer Science","first-page":"257","article-title":"Algorithms for finding patterns in strings","author":"Aho","year":"1990"},{"key":"10.1016\/0304-3975(93)90197-2_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(93)90197-2_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01758848","article-title":"Optimal parallel detection of squares in strings","volume":"8","author":"Apostolico","year":"1992","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/0304-3975(93)90197-2_BIB4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0890-5401(91)90016-U","article-title":"Optimal canonization of all substrings of a string","volume":"95","author":"Apostolico","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90197-2_BIB5","series-title":"Combinatorial Algorithms on Words","volume":"Vol. 12","year":"1985"},{"key":"10.1016\/0304-3975(93)90197-2_BIB6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","article-title":"Parallel construction of a suffix tree, with applications","volume":"3","author":"Apostolico","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(93)90197-2_BIB7","first-page":"309","article-title":"Highly parallelizable problems","author":"Berkman","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90197-2_BIB8","first-page":"439","article-title":"A lower bound for parallel string matching","author":"Breslauer","year":"1991","journal-title":"Proc. 23rd ACM Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(93)90197-2_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/1970044","article-title":"Free differential calculus","volume":"68","author":"Chen","year":"1958","journal-title":"Ann. Math."},{"issue":"3","key":"10.1016\/0304-3975(93)90197-2_BIB10","first-page":"651","article-title":"Two-way pattern matching","volume":"38","author":"Crochemore","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90197-2_BIB11","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","article-title":"Factorizing words over an ordered alphabet","volume":"4","author":"Duval","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90197-2_BIB12","first-page":"179","article-title":"Relations between concurrent-write models of parallel computation","author":"Fich","year":"1984"},{"key":"10.1016\/0304-3975(93)90197-2_BIB13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0019-9958(85)80031-0","article-title":"Optimal parallel algorithms for string matching","volume":"67","author":"Galil","year":"1985","journal-title":"Inform. and Control"},{"issue":"2","key":"10.1016\/0304-3975(93)90197-2_BIB14","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."},{"issue":"2","key":"10.1016\/0304-3975(93)90197-2_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","article-title":"Fast parallel and serial approximate string matching","volume":"10","author":"Landau","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90197-2_BIB16","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(93)90197-2_BIB17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = bN cP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/0304-3975(93)90197-2_BIB18","first-page":"319","article-title":"Suffix arrays: a new method for on-line string searches","author":"Manber","year":"1990","journal-title":"Proc. 1st SODA"},{"key":"10.1016\/0304-3975(93)90197-2_BIB19","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90197-2_BIB20","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","article-title":"Fast canonization of circular strings","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90197-2_BIB21","series-title":"Palavras, Automatos e Algoritmos \u2014 Uma Bibliografia","author":"Simon","year":"1990"},{"issue":"1","key":"10.1016\/0304-3975(93)90197-2_BIB22","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0220002","article-title":"Deterministic sampling \u2013 a new technique for fast pattern matching","volume":"20","author":"Vishkin","year":"1990","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0304-3975(93)90197-2_BIB23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds for the string editing problem","volume":"23","author":"Wong","year":"1976","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901972?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901972?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T01:42:52Z","timestamp":1621042972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593901972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0304397593901972"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90197-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}