{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:30:55Z","timestamp":1725525055587},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642003981"},{"type":"electronic","value":"9783642003998"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00399-8_8","type":"book-chapter","created":{"date-parts":[[2009,2,7]],"date-time":"2009-02-07T06:51:04Z","timestamp":1233989464000},"page":"87-98","source":"Crossref","is-referenced-by-count":8,"title":["A Tree Distance Function Based on Multi-sets"],"prefix":"10.1007","author":[{"given":"Arnoldo Jos\u00e9","family":"M\u00fcller-Molina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Augsten, N., Bhlen, M., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: VLDB 2005, pp. 301\u2013312 (2005)"},{"issue":"1-3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/253262.253266","volume":"26","author":"S.S. Chawathe","year":"1997","unstructured":"Chawathe, S.S., Garcia-Molina, H.: Meaningful change detection in structured data. SIGMOD Rec.\u00a026(2), 26\u201337 (1997)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1145\/235968.233366","volume":"25","author":"S.S. Chawathe","year":"1996","unstructured":"Chawathe, S.S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in hierarchically structured information. SIGMOD Rec.\u00a025(2), 493\u2013504 (1996)","journal-title":"SIGMOD Rec."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Automata, Languages and Programming","author":"E. Demaine","year":"2007","unstructured":"Demaine, E., Mosez, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/1061318.1061326","volume":"30","author":"M. Garofalakis","year":"2005","unstructured":"Garofalakis, M., Kumar, A.: Xml stream processing using tree-edit distance embeddings. ACM Trans. Database Syst.\u00a030(1), 279\u2013332 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"8_CR7","first-page":"148","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Theoretical Computer Science\u00a0143(1), 148\u2013157 (1995)","journal-title":"Theoretical Computer Science"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/978-3-540-24741-8_39","volume-title":"Advances in Database Technology - EDBT 2004","author":"K. Kailing","year":"2004","unstructured":"Kailing, K., Kriegel, H.-P., Sch\u00f6nauer, S., Seidl, T.: Efficient similarity search for hierarchical data in large databases. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 676\u2013693. Springer, Heidelberg (2004)"},{"key":"8_CR9","unstructured":"Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: SODA 2000, Philadelphia, USA. Society for Industrial and Applied Mathematics, pp. 696\u2013704 (2000)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms - ESA \u201998","author":"P.N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 91\u2013102. Springer, Heidelberg (1998)"},{"key":"8_CR11","first-page":"275","volume-title":"CASCON 2006","author":"A.J. M\u00fcller-Molina","year":"2006","unstructured":"M\u00fcller-Molina, A.J., Shinohara, T.: On approximate matching of programs for protecting libre software. In: CASCON 2006, pp. 275\u2013289. ACM Press, New York (2006)"},{"key":"8_CR12","first-page":"111","volume-title":"SCAM 2007","author":"A.J. M\u00fcller-Molina","year":"2007","unstructured":"M\u00fcller-Molina, A.J., Shinohara, T.: Fast approximate matching of programs for protecting libre\/open source software by using spatial indexes. In: SCAM 2007, pp. 111\u2013122. IEEE Computer Society, Los Alamitos (2007)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11563983_17","volume-title":"Discovery Science","author":"N. Ohkura","year":"2005","unstructured":"Ohkura, N., Hirata, K., Kuboyama, T., Harao, M.: The q-gram distance for ordered unlabeled trees. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol.\u00a03735, pp. 189\u2013202. Springer, Heidelberg (2005)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45884-0_14","volume-title":"Progress in Discovery Science","author":"T. Shinohara","year":"2002","unstructured":"Shinohara, T., Ishizaka, H.: On dimension reduction mappings for approximate retrieval of multi-dimensional data. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery Science. LNCS, vol.\u00a02281, pp. 224\u2013231. Springer, Heidelberg (2002)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.-C. Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. JACM\u00a026(3), 422\u2013433 (1979)","journal-title":"JACM"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: SIGMOD 2005, pp. 754\u2013765 (2005)","DOI":"10.1145\/1066157.1066243"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","volume":"28","author":"K. Zhang","year":"1995","unstructured":"Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recognition\u00a028(3), 463\u2013474 (1995)","journal-title":"Pattern Recognition"},{"key":"8_CR18","unstructured":"Zhang, K.: Computing similarity between rna secondary structures. In: INTSYS 1998, pp. 126\u2013132 (1998)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Information Processing Letters\u00a042(3), 133\u2013139 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00399-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T06:54:22Z","timestamp":1551768862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00399-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003981","9783642003998"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00399-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}