{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:52:43Z","timestamp":1759683163823},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0031-3203(94)00109-y","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"463-474","source":"Crossref","is-referenced-by-count":68,"title":["Algorithms for the constrained editing distance between ordered labeled trees and related problems"],"prefix":"10.1016","volume":"28","author":[{"family":"Kaizhong Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0031-3203(94)00109-Y_BIB1","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Comput. Appl. Biosci."},{"article-title":"Locating syntactic patterns in text corpora","year":"1990","author":"Chodorow","key":"10.1016\/0031-3203(94)00109-Y_BIB2"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jagm.1994.1003","article-title":"Approximate tree matching in the presence of variable length don't cares","volume":"16","author":"Zhang","year":"1994","journal-title":"J. of Algorithms"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","article-title":"The tree-to-tree correction problem","volume":"26","author":"Tai","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB5","first-page":"299","article-title":"Waveform correlation by tree matching","volume":"PAMI 7","author":"Cheng","year":"1985","journal-title":"IEEE Trans."},{"key":"10.1016\/0031-3203(94)00109-Y_BIB6","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Information Processing Letters"},{"issue":"6","key":"10.1016\/0031-3203(94)00109-Y_BIB7","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Computing"},{"article-title":"Ordered and unordered tree inclusion","year":"1991","author":"Kilpelainen","key":"10.1016\/0031-3203(94)00109-Y_BIB8_1"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB8_2","unstructured":"SIAM J. on Computing (to be published)."},{"article-title":"Numeric similarity and dissimilarity measures between trees","year":"1992","author":"Oommen","key":"10.1016\/0031-3203(94)00109-Y_BIB9"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB10","first-page":"219","article-title":"A tree-to-tree distance and its application to cluster analysis","volume":"PAMI 1","author":"Lu","year":"1979","journal-title":"IEEE Trans."},{"key":"10.1016\/0031-3203(94)00109-Y_BIB11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0031-3203(94)00109-Y_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the longest common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","article-title":"On the editing distance between unordered labeled tree","volume":"42","author":"Zhang","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","article-title":"Some MAX SNP-hard results concerning unordered labeled trees","volume":"49","author":"Zhang","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB15","unstructured":"K. Zhang, A constrained editing distance between unordered labeled trees, Algorithmica (to be published)."},{"key":"10.1016\/0031-3203(94)00109-Y_BIB16","first-page":"387","article-title":"An algorithm for comparing multiple RNA secondary structures","volume":"4","author":"Shapiro","year":"1988","journal-title":"Comput. Applic. Biosci."},{"key":"10.1016\/0031-3203(94)00109-Y_BIB17","series-title":"COINS Technical Report","article-title":"The taxonomy-based learning: algorithms and applications","author":"Hong","year":"1989"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","article-title":"The theory and computation of evolutionary distances","volume":"1","author":"Sellers","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB19","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. Algorithm"},{"key":"10.1016\/0031-3203(94)00109-Y_BIB20","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"},{"year":"1973","series-title":"Pattern Classification and Scene Analysis","author":"Duda","key":"10.1016\/0031-3203(94)00109-Y_BIB21"},{"issue":"4","key":"10.1016\/0031-3203(94)00109-Y_BIB22","first-page":"560","article-title":"ATBE: A system for approximate tree matching","volume":"6","author":"Wang","year":"1994","journal-title":"IEEE Trans. on Knowledge and Data Engineering"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039400109Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039400109Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:59:01Z","timestamp":1556384341000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/003132039400109Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["003132039400109Y"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(94)00109-y","relation":{},"ISSN":["0031-3203"],"issn-type":[{"type":"print","value":"0031-3203"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}