{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:44:42Z","timestamp":1743018282766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319754161"},{"type":"electronic","value":"9783319754178"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75417-8_26","type":"book-chapter","created":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T11:13:28Z","timestamp":1518520408000},"page":"276-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Path Histogram Distance for Rooted Labeled Caterpillars"],"prefix":"10.1007","author":[{"given":"Taiga","family":"Kawaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"Yoshino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,14]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-00399-8_9","volume-title":"New Frontiers in Applied Data Mining","author":"T Aratsu","year":"2009","unstructured":"Aratsu, T., Hirata, K., Kuboyama, T.: Sibling distance for rooted labeled trees. In: Chawla, S., Washio, T., Minato, S., Tsumoto, S., Onoda, T., Yamada, S., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5433, pp. 99\u2013110. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00399-8_9"},{"key":"26_CR2","unstructured":"Gallian, J.A.: A dynamic survey of graph labeling, Electorn. J. Combin. 14, DS6 (2007)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-642-21458-5_34","volume-title":"Combinatorial Pattern Matching","author":"K Hirata","year":"2011","unstructured":"Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX\u00a0SNP-hard results for finding an edit distance between unordered trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 402\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21458-5_34"},{"key":"26_CR4","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. 2992, pp. 676\u2013693. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24741-8_39"},{"key":"26_CR5","unstructured":"Kuboyama, T.: Matching and learning in trees, Ph.D. thesis, University of Tokyo (2007)"},{"key":"26_CR6","first-page":"29","volume":"43","author":"F Li","year":"2013","unstructured":"Li, F., Wang, H., Li, J., Gao, H.: A survey on tree edit distance lower bound estimation techniques for similarity join on XML data. SIGMOD Rec. 43, 29\u201339 (2013)","journal-title":"SIGMOD Rec."},{"key":"26_CR7","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. J. ACM 26, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0129054114500154","volume":"25","author":"Y Yamamoto","year":"2014","unstructured":"Yamamoto, Y., Hirata, K., Kuboyama, T.: Tractable and intractable variations of unordered tree edit distance. Int. J. Found. Comput. Sci. 25, 307\u2013330 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s00224-016-9705-1","volume":"60","author":"T Yoshino","year":"2017","unstructured":"Yoshino, T., Hirata, K.: Tai mapping hierarchy for rooted labeled trees through common subforest. Theory Comput. Syst. 60, 759\u2013783 (2017)","journal-title":"Theory Comput. Syst."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K Zhang","year":"1996","unstructured":"Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"26_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 SNP-hard results concerning unordered labeled trees. Inf. Process. Lett. 49, 249\u2013254 (1994)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75417-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:17:01Z","timestamp":1710339421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75417-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319754161","9783319754178"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75417-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"14 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dong Hoi City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2018\/index.php#about","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}