{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:56:55Z","timestamp":1649023015076},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00270-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"197-201","source":"Crossref","is-referenced-by-count":4,"title":["Tree pattern matching with a more general notion of occurrence of the pattern"],"prefix":"10.1016","volume":"82","author":[{"given":"Cedric","family":"Chauve","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00270-8_BIB001","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\/S0020-0190(01)00270-8_BIB002","series-title":"Pattern Matching Algorithms","year":"1997"},{"key":"10.1016\/S0020-0190(01)00270-8_BIB003","series-title":"Proc. ACM Symposium on Theory of Computing, STOC'97","first-page":"66","article-title":"Tree pattern matching and subset matching in randomized O(nlog3m) time","author":"Cole","year":"1997"},{"key":"10.1016\/S0020-0190(01)00270-8_BIB004","series-title":"Proc. ACM\u2013SIAM Symposium on Discrete Algorithms, SODA'99","first-page":"245","article-title":"Tree pattern matching and subset matching in deterministic O(nlog3n)-time","author":"Cole","year":"1999"},{"key":"10.1016\/S0020-0190(01)00270-8_BIB005","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"issue":"2","key":"10.1016\/S0020-0190(01)00270-8_BIB006","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/174652.174653","article-title":"Faster tree pattern matching","volume":"41","author":"Dubiner","year":"1994","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0020-0190(01)00270-8_BIB007","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffmann","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00270-8_BIB008","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1997"},{"key":"10.1016\/S0020-0190(01)00270-8_BIB009","series-title":"Proc. IEEE Symposium on Foundations of Computer Science, FOCS'89","first-page":"178","article-title":"Efficient tree pattern matching","author":"Kosaraju","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(01)00270-8_BIB010","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(91)90062-M","article-title":"An efficient algorithm for some tree matching problems","volume":"39","author":"Luccio","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(01)00270-8_BIB011","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/inco.1995.1160","article-title":"Approximate matching for two families of trees","volume":"123","author":"Luccio","year":"1995","journal-title":"Inform. and Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002708?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002708?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:26:49Z","timestamp":1555766809000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002708"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00270-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}