{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:55:04Z","timestamp":1740099304797,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054526"},{"type":"electronic","value":"9783030054533"}],"license":[{"start":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T00:00:00Z","timestamp":1546128000000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05453-3_21","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T02:02:29Z","timestamp":1546135349000},"page":"443-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Mapping Distances for Semi-Structured Data"],"prefix":"10.1007","author":[{"given":"Kilho","family":"Shin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taro","family":"Niiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,30]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate: a practical and powerful approach to multiple testing. J. Roy. Stat. Soc. B 57(1), 289\u2013300 (1995)","journal-title":"J. Roy. Stat. Soc. B"},{"issue":"1\u20133","key":"21_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. Theoret. Comput. Sci. 337(1\u20133), 217\u2013239 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Collins, M., Duffy, N.: Convolution kernels for natural language. In: Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic NIPS, vol. 2001], pp. 625\u2013632. MIT Press, Boca Raton (2001)","DOI":"10.7551\/mitpress\/1120.003.0085"},{"key":"21_CR4","first-page":"2","volume":"6","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algo. 6, 2 (2006)","journal-title":"ACM Trans. Algo."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-44888-8_7","volume-title":"Combinatorial Pattern Matching","author":"Serge Dulucq","year":"2003","unstructured":"Dulucq, S., Touzet, H.: Analysis of tree edit distance algorithms. In: The 14th Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 83\u201395 (2003)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"63R","DOI":"10.1093\/glycob\/cwj010","volume":"16","author":"K Hashimoto","year":"2006","unstructured":"Hashimoto, K., Goto, S., Kawano, S., Aoki-Kinoshita, K.F., Ueda, N.: KEGG as a glycome informatics resource. Glycobiology 16, 63R\u201370R (2006)","journal-title":"Glycobiology"},{"key":"21_CR7","unstructured":"Kao, M.Y., Lam, T.W., Sung, W.K., Ting, H.F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings, July 2007"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms \u2014 ESA 1998","author":"PN Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 91\u2013102. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_8"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/11560586_26","volume-title":"Theoretical Computer Science","author":"T Kuboyama","year":"2005","unstructured":"Kuboyama, T., Shin, K., Miyahara, T., Yasuda, H.: A theoretical analysis of alignment and edit problems for trees. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 323\u2013337. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11560586_26"},{"issue":"8","key":"21_CR10","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10(8), 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-44679-6_37","volume-title":"Computing and Combinatorics","author":"CL Lu","year":"2001","unstructured":"Lu, C.L., Su, Z.-Y., Tang, C.Y.: A new measure of edit distance between labeled trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 338\u2013348. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44679-6_37"},{"key":"21_CR12","unstructured":"Moschitti, A.: Example data for tree kernels in SVM-light. http:\/\/disi.unitn.it\/moschitti\/Tree-Kernel.htm"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: Bridging the gap between graph edit distance and kernel machines. World Scientific (2007)","DOI":"10.1142\/6523"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"334","DOI":"10.14778\/2095686.2095692","volume":"5","author":"M Pawlik","year":"2011","unstructured":"Pawlik, M., Augsten, N.: Rted: a robust algorithm for the tree edit distance. Proc. VLDB Endowment. 5, 334\u2013345 (2011)","journal-title":"Proc. VLDB Endowment."},{"issue":"S\u20133","key":"21_CR15","doi-asserted-by":"publisher","first-page":"S6","DOI":"10.1186\/1471-2105-9-S3-S6","volume":"9","author":"S Pyysalo","year":"2008","unstructured":"Pyysalo, S., Airola, A., Heimonen, J., Bjorne, J., Ginter, F., Salakoski, T.: Comparative analysis of five protein-protein interaction corpora. BMC Bioinform. 9(S\u20133), S6 (2008)","journal-title":"BMC Bioinform."},{"key":"21_CR16","unstructured":"Richter, T.: A new measure of the distance between ordered trees and its applications. Tech. Rep. 85166-CS, Dept. of Computer Science, Univ. of Bonn (1997). http:\/\/citeseer.ist.psu.edu\/richter97new.html"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ipl.2014.09.002","volume":"115","author":"K Shin","year":"2015","unstructured":"Shin, K.: Tree edit distance and maximum agreement subtree. Inf. Process. Lett. 115(1), 69\u201373 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2014.09.002","journal-title":"Inf. Process. Lett."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Shin, K., Niiyama, T.: The mapping distance - a generalization of the edit distance - and its application to trees. In: Proceedings of the 10th International Conference on Agent and Artificial Intelligence ICAART 2018, vol. 2, pp. 266\u2013275. SciTePress (2018)","DOI":"10.5220\/0006721902660275"},{"issue":"3","key":"21_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Ta\u00ef","year":"1979","unstructured":"Ta\u00ef, K.C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0031-3203(99)00199-5","volume":"34","author":"JTL Wang","year":"2001","unstructured":"Wang, J.T.L., Zhang, K.: Finding similar consensus between trees: an algorithm and a distance hierarchy. Pattern Recognit. 34, 127\u2013137 (2001)","journal-title":"Pattern Recognit."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10994-006-5832-2","volume":"62","author":"MJ Zaki","year":"2006","unstructured":"Zaki, M.J., Aggarwal, C.C.: XRules: an effective algorithm for structural classification of XML data. Mach. Learn. 62, 137\u2013170 (2006)","journal-title":"Mach. Learn."},{"issue":"3","key":"21_CR22","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 Recognit. 28(3), 463\u2013474 (1995)","journal-title":"Pattern Recognit."},{"issue":"6","key":"21_CR23","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. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"issue":"01","key":"21_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054196000051","volume":"07","author":"KAIZHONG ZHANG","year":"1996","unstructured":"Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs. Int. J. Found. Comput. Sci. 7(1), 43\u201358 (1996). http:\/\/citeseer.ist.psu.edu\/article\/zhang95editing.html","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05453-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T18:22:27Z","timestamp":1720894947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05453-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,30]]},"ISBN":["9783030054526","9783030054533"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05453-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,30]]},"assertion":[{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Funchal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"16 January 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 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":"icaart2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.org\/?y=2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26 Posters","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}