{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:29:33Z","timestamp":1758475773846},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354056764X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029810","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:36:08Z","timestamp":1133429768000},"page":"254-265","source":"Crossref","is-referenced-by-count":20,"title":["A new editing based distance between unordered labeled trees"],"prefix":"10.1007","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin,\u2019 Fast parallel and serial approximate string matching', J. Algorithms, vol. 10, pp. 157\u2013169, 1989","journal-title":"J. Algorithms"},{"key":"19_CR2","unstructured":"Pekka Kilpelainen and Heikki Mannila, \u2018Ordered and unordered tree inclusion', To appear SIAM J. on Computing"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. H. Sellers","year":"1980","unstructured":"P. H. Sellers, \u2018The theory and computation of evolutionary distances\u2019 J. Algorithms vol. 1, pp.359\u2013373, 1980","journal-title":"J. Algorithms"},{"issue":"no.4","key":"19_CR4","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"Bruce Shapiro and Kaizhong Zhang, \u2018Comparing multiple RNA secondary structures using tree comparisons\u2019 Comput. Appl. Biosci. vol. 6, no. 4, pp.309\u2013318, 1990","journal-title":"Comput. Appl. Biosci."},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. C. Tai","year":"1979","unstructured":"K. C. Tai, \u2018The tree-to-tree correction problem', J. ACM, vol. 26, pp.422\u2013433, 1979","journal-title":"J. ACM"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Robert E. Tarjan, \u2018Data structures and network algorithms', CBMS-NSF Regional Conference Series in Applied Mathematics, 1983","DOI":"10.1137\/1.9781611970265"},{"issue":"no.2","key":"19_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218001488000157","volume":"2","author":"E. Tanaka","year":"1988","unstructured":"E. Tanaka and K. Tanaka, \u2018The tree-to-tree editing problem', International Journal of Pattern Recognition and Artificial Intelligence', vol. 2, no. 2, pp.221\u2013240 1988","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence'"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E. Ukkonen","year":"1985","unstructured":"E. Ukkonen, \u2018Finding approximate patterns in strings', J. Algorithm, vol. 6, pp. 132\u2013137, 1985","journal-title":"J. Algorithm"},{"key":"19_CR9","unstructured":"Jason T.L. Wang, Kaizhong Zhang, Karpjoo Jeong and Dennis Shasha \u2018ATBE: A system for approximate tree matching', To appear IEEE Trans. on Knowledge and Data Engineering"},{"key":"19_CR10","unstructured":"Kaizhong Zhang, \u2018An editing based distance between ordered labeled trees', In preparation."},{"issue":"no.6","key":"19_CR11","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Kaizhong Zhang and Dennis Shasha, \u2018Simple fast algorithms for the editing distance between trees and related problems', SIAM J. Computing vol. 18, no. 6, pp. 1245\u20131262, 1989","journal-title":"SIAM J. Computing"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"no. 42","author":"K. Zhang","year":"1992","unstructured":"Kaizhong Zhang, Rick Statman and Dennis Shasha, \u2018On the editing distance between unordered labeled trees\u2019 Information Processing Letters no. 42, pp. 133\u2013139, 1992","journal-title":"Information Processing Letters"},{"key":"19_CR13","unstructured":"Kaizhong Zhang, Dennis Shasha, and Jason Wang, \u2018Approximate tree matching in the presence of variable length don't cares', To appear J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029810.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:00:28Z","timestamp":1607551228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354056764X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029810","relation":{},"subject":[]}}