{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:33:24Z","timestamp":1770971604420,"version":"3.50.1"},"reference-count":0,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2002,5,25]],"date-time":"2002-05-25T00:00:00Z","timestamp":1022284800000},"content-version":"vor","delay-in-days":3066,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1006\/jagm.1994.1003","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T16:51:01Z","timestamp":1033923061000},"page":"33-66","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":59,"title":["Approximate Tree Matching in the Presence of Variable Length Don\u2032t Cares"],"prefix":"10.1006","volume":"16","author":[{"given":"K.Z.","family":"Zhang","sequence":"first","affiliation":[]},{"given":"D.","family":"Shasha","sequence":"additional","affiliation":[]},{"given":"J.T.L.","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677484710030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677484710030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:08:26Z","timestamp":1759298906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677484710030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["S0196677484710030"],"URL":"https:\/\/doi.org\/10.1006\/jagm.1994.1003","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate Tree Matching in the Presence of Variable Length Don\u2032t Cares","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/jagm.1994.1003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}