{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:53:11Z","timestamp":1760644391094},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":[[1995,4]]},"DOI":"10.1016\/0167-8655(94)00109-g","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"339-345","source":"Crossref","is-referenced-by-count":16,"title":["A near pattern-matching scheme based upon principal component analysis"],"prefix":"10.1016","volume":"16","author":[{"given":"C.Y.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(94)00109-G_BIB1","series-title":"Computer-Aided Multivariate Analysis","author":"Afifi","year":"1990"},{"issue":"6","key":"10.1016\/0167-8655(94)00109-G_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8655(94)00109-G_BIB3","series-title":"Proc. Internat. Symposium on New Directions in Computing","first-page":"122","article-title":"Matching string patterns in large textual files","author":"Berkovich","year":"1985"},{"issue":"10","key":"10.1016\/0167-8655(94)00109-G_BIB4","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8655(94)00109-G_BIB5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TIT.1967.1054021","article-title":"On the generalized Karhunen-Loeve expansion","volume":"13","author":"Chien","year":"1967","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0167-8655(94)00109-G_BIB6","series-title":"Sequential Methods in Pattern Recognition and Machine Learning","author":"Fu","year":"1968"},{"key":"10.1016\/0167-8655(94)00109-G_BIB7","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"issue":"2","key":"10.1016\/0167-8655(94)00109-G_BIB8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1970","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8655(94)00109-G_BIB9","article-title":"High Speed Multi-term String Matching Algorithm","author":"Kowalski","year":"1983"},{"issue":"3","key":"10.1016\/0167-8655(94)00109-G_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/TSE.1976.225946","article-title":"Application of principal components analysis to multikey searching","volume":"2","author":"Lee","year":"1976","journal-title":"IEEE Trans. Software Engnrg."},{"key":"10.1016\/0167-8655(94)00109-G_BIB11","series-title":"Multivariate Statistical Methods","author":"Morrison","year":"1990"},{"key":"10.1016\/0167-8655(94)00109-G_BIB12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/spe.4380120106","article-title":"A comparison of three string matching algorithms","volume":"12","author":"Smit","year":"1982","journal-title":"Software Practice and Experience"},{"key":"10.1016\/0167-8655(94)00109-G_BIB13","series-title":"Proc. Internat. Symposium on New Directions in Computing","first-page":"114","article-title":"A high-speed text scanning algorithm utilizing least frequent trigraphs","author":"Yochum","year":"1985"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559400109G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559400109G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:26:35Z","timestamp":1555568795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559400109G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["016786559400109G"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(94)00109-g","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}