{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:55Z","timestamp":1761611095143},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":[[1991,7]]},"DOI":"10.1016\/0020-0190(91)90159-f","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"81-84","source":"Crossref","is-referenced-by-count":9,"title":["A note on the subtree isomorphism for ordered trees and related problems"],"prefix":"10.1016","volume":"39","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90159-F_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/FSCS.1990.89533","article-title":"Faster tree pattern matching","author":"Dubiner","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(91)90159-F_BIB2","first-page":"113","article-title":"String matching and other products","author":"Fischer","year":"1974","journal-title":"Complexity of Computation, SIAM-AMS Proc."},{"key":"10.1016\/0020-0190(91)90159-F_BIB3","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(91)90159-F_BIB4","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\/0020-0190(91)90159-F_BIB5","series-title":"Handbook of Theoretical Computer Science, Vol. A","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(91)90159-F_BIB6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/SFCS.1989.63475","article-title":"Efficient tree pattern matching","author":"Kosaraju","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(91)90159-F_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53982-4_11","article-title":"Simple solutions for approximate tree matching problems","author":"Luccio","year":"1991","journal-title":"Proc. 4th TAPSOFT'91"},{"key":"10.1016\/0020-0190(91)90159-F_BIB8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(89)90056-2","article-title":"On the subtree isomorphism problem for ordered trees","volume":"32","author":"M\u00e4kinen","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90159-F_BIB9","series-title":"Combinatorial algorithms on words","first-page":"11","article-title":"Efficient string matching with don't-cares patterns","author":"Pinter","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190159F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190159F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T16:53:06Z","timestamp":1583772786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190159F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["002001909190159F"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90159-f","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}