{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T01:51:35Z","timestamp":1679622695149},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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":[[1990,7]]},"DOI":"10.1016\/0304-3975(90)90182-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"319-328","source":"Crossref","is-referenced-by-count":2,"title":["String matching with weighted errors"],"prefix":"10.1016","volume":"73","author":[{"given":"Alan A.","family":"Bertossi","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Luccio","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90182-H_BIB1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1137\/0215007","article-title":"The Boyer-Moore-Galil string searching strategies revisted","volume":"15","author":"Apostolico","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90182-H_BIB2","first-page":"46","article-title":"Approximate string matching with context-dependency","author":"Bertossi","year":"1987","journal-title":"Proc. 25th Ann. Allerton Conference"},{"key":"10.1016\/0304-3975(90)90182-H_BIB3","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1109\/TASSP.1986.1164918","article-title":"Systolic architectures for connected speech recognition","volume":"34","author":"Charot","year":"1986","journal-title":"IEEE Trans. Acoustic, Speech Signal Proc."},{"key":"10.1016\/0304-3975(90)90182-H_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0885-064X(88)90008-8","article-title":"Data structures and algorithms for approximate string matching","volume":"4","author":"Galil","year":"1988","journal-title":"J. Complexity"},{"key":"10.1016\/0304-3975(90)90182-H_BIB5","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","article-title":"Time-space-optimal string matching","volume":"26","author":"Galil","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90182-H_BIB6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90182-H_BIB7","doi-asserted-by":"crossref","first-page":"322","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\/0304-3975(90)90182-H_BIB8","first-page":"220","article-title":"Introducing efficient parallelism into approximate string matching and a new serial algorithm","author":"Landau","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90182-H_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","article-title":"Fast string matching with k differences","volume":"37","author":"Landau","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90182-H_BIB10","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(90)90182-H_BIB11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90182-H_BIB12","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","article-title":"Recognition of noisy subsequences using constrained edit distances","volume":"9","author":"Oommen","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intel."},{"key":"10.1016\/0304-3975(90)90182-H_BIB13","year":"1983"},{"key":"10.1016\/0304-3975(90)90182-H_BIB14","first-page":"487","article-title":"On approximate string matching","volume":"158","author":"Ukkonen","year":"1983"},{"key":"10.1016\/0304-3975(90)90182-H_BIB15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(90)90182-H_BIB16","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090182H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090182H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:39Z","timestamp":1555127499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090182H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["030439759090182H"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90182-h","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}