{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:42:47Z","timestamp":1710351767221},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0020-0190(95)00111-o","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"235-239","source":"Crossref","is-referenced-by-count":14,"title":["Approximate string matching with don't care characters"],"prefix":"10.1016","volume":"55","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00111-O_BIB1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","article-title":"Generalized string matching","volume":"16","author":"Abrahamson","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00111-O_BIB2","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\/0020-0190(95)00111-O_BIB3","series-title":"Introduction to Protein Structure","author":"Branden","year":"1991"},{"key":"10.1016\/0020-0190(95)00111-O_BIB4","series-title":"Complexity of Computation","first-page":"113","article-title":"String matching and other products","volume":"7","author":"Fischer","year":"1974"},{"key":"10.1016\/0020-0190(95)00111-O_BIB5","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\/0020-0190(95)00111-O_BIB6","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0219067","article-title":"An improved algorithm for approximate string matching","volume":"19","author":"Galil","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(95)00111-O_BIB7","series-title":"Sequence Analysis in Molecular Biology \u2014 Treasure Trove or Trivial Pursuit","author":"Heijne","year":"1987"},{"key":"10.1016\/0020-0190(95)00111-O_BIB8","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1j\u00e1","year":"1992"},{"key":"10.1016\/0020-0190(95)00111-O_BIB9","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\/0020-0190(95)00111-O_BIB10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(91)90032-D","article-title":"An algorithm for string matching with a sequence of don't cares","volume":"37","author":"Manber","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00111-O_BIB11","series-title":"Combinatorial Algorithms on Words","first-page":"11","article-title":"Efficient string matching with don't-care patterns","volume":"12","author":"Pinter","year":"1985"},{"key":"10.1016\/0020-0190(95)00111-O_BIB12","series-title":"Proc. IEEE Symp. Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500111O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500111O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T13:51:51Z","timestamp":1556286711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500111O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["002001909500111O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00111-o","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}