{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:18:01Z","timestamp":1648826281002},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-8655(96)00128-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:05:40Z","timestamp":1027627540000},"page":"63-72","source":"Crossref","is-referenced-by-count":0,"title":["Vectorizations of randomized matching for run-length coded strings"],"prefix":"10.1016","volume":"18","author":[{"given":"Kuo-Liang","family":"Chung","sequence":"first","affiliation":[]},{"given":"Wen-Ming","family":"Yan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB1","first-page":"438","volume":"21","author":"Aho","year":"1975"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02243873","article-title":"An algorithm for matching run-length coded strings","volume":"50","author":"Bunke","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(95)00005-W","article-title":"An improved algorithm for computing the edit distance of run-length coded strings","volume":"54","author":"Bunke","year":"1995","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0167-8655(96)00128-6_NEWBIB4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02238127","article-title":"Fast string matching algorithms for run-length coded strings","volume":"54","author":"Chung","year":"1995","journal-title":"Computing"},{"issue":"5","key":"10.1016\/S0167-8655(96)00128-6_NEWBIB5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0167-8655(96)00007-4","article-title":"O(1)-time parallel string-matching algorithm with VLDCs","volume":"17","author":"Chung","year":"1996","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB6","article-title":"Vectorized computations for string matchings","author":"Chung","year":"1994"},{"issue":"11","key":"10.1016\/S0167-8655(96)00128-6_NEWBIB7","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1109\/12.475130","article-title":"Fast vectorization for Calculating a moving sum","volume":"44","author":"Chung","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/69.219740","article-title":"An efficient algorithm for matching multiple patterns","volume":"5","author":"Fan","year":"1993","journal-title":"IEEE Trans. Knowledge and Data Engrg."},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB9","first-page":"275","article-title":"Discrete and Combinatorial Mathematics: An Applied Introduction","author":"Grimaldi","year":"1994"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB10","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB11","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB12","first-page":"47","article-title":"Numerical Analysis","author":"Kincaid","year":"1996"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB13","author":"Levesque","year":"1989"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB14","series-title":"Digital Picture Processing","author":"Rosenfeld","year":"1982"},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0167-8655(96)00128-6_NEWBIB16","article-title":"Supercomputer Programming (I): Advanced Fortran: Architecture, Vectorization, and Parallel Computing","year":"1991","journal-title":"Working manual for CRAY X-MP EA\/ 116se"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865596001286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865596001286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:53:06Z","timestamp":1580345586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865596001286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0167865596001286"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(96)00128-6","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}