{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:31:04Z","timestamp":1725525064665},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_9","type":"book-chapter","created":{"date-parts":[[2009,2,7]],"date-time":"2009-02-07T01:51:04Z","timestamp":1233971464000},"page":"99-110","source":"Crossref","is-referenced-by-count":1,"title":["Sibling Distance for Rooted Labeled Trees"],"prefix":"10.1007","author":[{"given":"Taku","family":"Aratsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuji","family":"Kuboyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ipl.2006.06.002","volume":"100","author":"T. Akutsu","year":"2006","unstructured":"Akutsu, T.: A relationship between edit distance for ordered trees and edit distance for Euler strings. Inform. Proc. Let.\u00a0100, 105\u2013109 (2006)","journal-title":"Inform. Proc. Let."},{"key":"9_CR2","unstructured":"Augsten, N., B\u00f6hlen, M., Gamper, J.: Approximate matching of hierarchical data using pq-grams. In: Proc. VLDB 2005, pp. 301\u2013312 (2005)"},{"key":"9_CR3","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. Theoret. Comput. Sci.\u00a0337, 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","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.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, 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)"},{"key":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-68125-0_18","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T. Kuboyama","year":"2008","unstructured":"Kuboyama, T., Hirata, K., Aoki-Kinoshita, K.F.: An efficient unordered tree kernel and its application to glycan classification. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 184\u2013195. Springer, Heidelberg (2008)"},{"key":"9_CR7","unstructured":"Kuboyama, T., Hirata, K., Ohkura, N., Harao, M.: A q-gram based distance measure for ordered labeled trees. In: Proc. LLLL 2006, pp. 77\u201383 (2006)"},{"key":"9_CR8","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":"9_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theor. Comput. Sci.\u00a092, 191\u2013211 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: Proc. SIGMOD 2005, pp. 754\u2013765 (2005)","DOI":"10.1145\/1066157.1066243"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K. Zhang","year":"1994","unstructured":"Zhang, K., Jiang, T.: Some MAX\u00a0SNP-hard results concerning unordered labeled trees. Inform. Process. Let.\u00a049, 249\u2013254 (1994)","journal-title":"Inform. Process. Let."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"9_CR13","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. Inform. Process. Let.\u00a042, 133\u2013139 (1992)","journal-title":"Inform. Process. Let."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T01:35:30Z","timestamp":1551749730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00399-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003981","9783642003998"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00399-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}