{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T19:00:12Z","timestamp":1775761212050,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90136-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"133-139","source":"Crossref","is-referenced-by-count":228,"title":["On the editing distance between unordered labeled trees"],"prefix":"10.1016","volume":"42","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Rick","family":"Statman","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90136-J_BIB1","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/0020-0190(92)90136-J_BIB2","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/0020-0190(92)90136-J_BIB3","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\/0020-0190(92)90136-J_BIB4","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"},{"key":"10.1016\/0020-0190(92)90136-J_BIB5","series-title":"Ph.D. Thesis","article-title":"The editing distance between trees: algorithms and applications","author":"Zhang","year":"1989"},{"key":"10.1016\/0020-0190(92)90136-J_BIB6","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. Comput."},{"key":"10.1016\/0020-0190(92)90136-J_BIB7","series-title":"Tech. Rept. No. 289","article-title":"On the editing distance between unordered labeled trees","author":"Zhang","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290136J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290136J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:27Z","timestamp":1555129647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290136J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290136J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90136-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}