{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T23:16:06Z","timestamp":1781219766746,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf01975866","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T16:17:33Z","timestamp":1122826653000},"page":"205-222","source":"Crossref","is-referenced-by-count":138,"title":["A constrained edit distance between unordered labeled trees"],"prefix":"10.1007","volume":"15","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01975866_CR1","doi-asserted-by":"crossref","unstructured":"A. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems,Proc. 33rd IEEE Symp. on the Foundation of Computer Science, 1992, pp. 14\u201323.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"BF01975866_CR2","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, Fast parallel and serial approximate string matching,J. Algorithms,10 (1989), 157\u2013169.","journal-title":"J. Algorithms"},{"key":"BF01975866_CR3","first-page":"202","volume":"1","author":"P. Kilpelainen","year":"1991","unstructured":"P. Kilpelainen and H. Mannila, The tree inclusion problem,Proc. Internat. Joint Conf. on the Theory and Practice of Software Development (CAAP '91), 1991, Vol. 1, pp. 202\u2013214.","journal-title":"Proc. Internat. Joint Conf. on the Theory and Practice of Software Development (CAAP '91)"},{"key":"BF01975866_CR4","unstructured":"S. Masuyama, Y. Takahashi, T. Okuyama, and S. Sasaki, On the largest common subgraph problem,Algorithms and Computing Theory, RIMS, Kokyuroku (Kyoto University), 1990, pp. 195\u2013201."},{"key":"BF01975866_CR5","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, The theory and computation of evolutionary distances,J. Algorithms,1 (1980), 359\u2013373.","journal-title":"J. Algorithms"},{"issue":"4","key":"BF01975866_CR6","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"B. Shapiro and K. Zhang, Comparing multiple RNA secondary structures using tree comparisons,Comput. Appl. Biosci.,6(4) (1990), 309\u2013318.","journal-title":"Comput. Appl. Biosci."},{"key":"BF01975866_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02426925","volume":"1","author":"F. Y. Shih","year":"1991","unstructured":"F. Y. Shih, Object representation and recognition using mathematical morphology model,J. System Integration,1 (1991), 235\u2013256.","journal-title":"J. System Integration"},{"key":"BF01975866_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/34.23111","volume":"11","author":"F. Y. Shih","year":"1989","unstructured":"F. Y. Shih and O. R. Mitchell, Threshold decomposition of grayscale morphology into binary morphology,IEEE Trans. Pattern Anal. Mach. Intell.,11 (1989), 31\u201342.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"BF01975866_CR9","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. C. Tai","year":"1979","unstructured":"K. C. Tai, The tree-to-tree correction problem,J. Assoc. Comput. Mach.,26 (1979), 422\u2013433.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01975866_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2116\/analsci.3.23","volume":"3","author":"Y. Takahashi","year":"1987","unstructured":"Y. Takahashi, Y. Satoh, H. Suzuki, and S. Sasaki, Recognition of largest common structural fragment among a variety of chemical structures,Anal. Sci.,3 (1987), 23\u201328.","journal-title":"Anal. Sci."},{"issue":"2","key":"BF01975866_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218001488000157","volume":"2","author":"E. Tanaka","year":"1988","unstructured":"E. Tanaka and K. Tanaka, The tree-to-tree editing problem,Internat. J. Pattern Recog. Artificial Intell.,2(2) (1988), 221\u2013240.","journal-title":"Internat. J. Pattern Recog. Artificial Intell."},{"key":"BF01975866_CR12","volume-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan,Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, CBMS, Washington, DC, 1983."},{"key":"BF01975866_CR13","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, Finding approximate patterns in strings,J. Algorithms,6 (1985), 132\u2013137.","journal-title":"J. Algorithms"},{"issue":"4","key":"BF01975866_CR14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/69.298173","volume":"6","author":"J. T. L. Wang","year":"1994","unstructured":"J. T. L. Wang, Kaizhong Zhang, Karpjoo Jeong, and D. Shasha, ATBE: a system for approximate tree matching,IEEE Trans. Knowledge Data Engrg,6(4) (1994), 559\u2013571.","journal-title":"IEEE Trans. Knowledge Data Engrg"},{"key":"BF01975866_CR15","unstructured":"Kaizhong Zhang, Algorithms for the Constrained Editing Distance Between Ordered Labeled Trees and Related Problems, Technical Report No. 361, Department of Computer Science, University of Western Ontario, 1993."},{"key":"BF01975866_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"Kaizhong Zhang","year":"1994","unstructured":"Kaizhong Zhang and Tao Jiang, Some MAX SNP-hard results concerning unordered labeled trees,Inform. Process. Lett.,49 (1994), 249\u2013254.","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"BF01975866_CR17","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"Kaizhong Zhang","year":"1989","unstructured":"Kaizhong Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems,SIAM J. Comput.,18(6) (1989), 1245\u20131262.","journal-title":"SIAM J. Comput."},{"key":"BF01975866_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jagm.1994.1003","volume":"16","author":"Kaizhong Zhang","year":"1994","unstructured":"Kaizhong Zhang, D. Shasha, and J. Wang, Approximate tree matching in the presence of variable length don't cares,J. Algorithms,16 (1994), 33\u201366.","journal-title":"J. Algorithms"},{"key":"BF01975866_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"Kaizhong Zhang","year":"1992","unstructured":"Kaizhong Zhang, R. Statman and D. Shasha, On the editing distance between unordered labeled trees,Inform. Process. Lett.,42 (1992), 133\u2013139.","journal-title":"Inform. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975866.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01975866\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:31:01Z","timestamp":1557772261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01975866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01975866"],"URL":"https:\/\/doi.org\/10.1007\/bf01975866","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}