{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:37:33Z","timestamp":1725586653912},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212567"},{"type":"electronic","value":"9783642212574"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21257-4_61","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T02:54:53Z","timestamp":1308365693000},"page":"492-499","source":"Crossref","is-referenced-by-count":0,"title":["A Distance for Partially Labeled Trees"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Calvo","sequence":"first","affiliation":[]},{"given":"David","family":"Rizo","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 M.","family":"I\u00f1esta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"61_CR1","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. Theorical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theorical Computer Science"},{"key":"61_CR2","first-page":"427","volume-title":"SODA 1997: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"B. DasGupta","year":"1997","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: SODA 1997: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 427\u2013436. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees: A data structure for retrieval on composite keys. Acta Inf.\u00a04, 1\u20139 (1974)","journal-title":"Acta Inf."},{"key":"61_CR4","unstructured":"Garris, M.D., Wilkinson, R.A.: Nist special database 3: Handwritten segmented characters. NIST, Gaithersburg, Md"},{"key":"61_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-89689-0_13","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"A. Habrard","year":"2008","unstructured":"Habrard, A., I\u00f1esta, J.M., Rizo, D., Sebban, M.: Melody recognition with learned edit distances. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol.\u00a05342, pp. 86\u201396. Springer, Heidelberg (2008)"},{"key":"61_CR6","unstructured":"Isert, C.: The editing distance between trees (1999)"},{"issue":"1","key":"61_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. Theoretical Computer Science\u00a0143(1), 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Kuboyama, T., Shin, K., Miyahara, T.: A hierarchy of tree edit distance measures. Theoretical Computer Science and its Applications (2005)","DOI":"10.2197\/ipsjdc.1.654"},{"issue":"5","key":"61_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ipl.2005.02.005","volume":"94","author":"C.-M. Lee","year":"2005","unstructured":"Lee, C.-M., Hung, L.-J., Chang, M.-S., Shen, C.-B., Tang, C.-Y.: An improved algorithm for the maximum agreement subtree problem. Information Processing Letters\u00a094(5), 211\u2013216 (2005)","journal-title":"Information Processing Letters"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Marcus, M., Kim, G., Marcinkiewicz, M.A., Macintyre, R., Bies, A., Ferguson, M., Katz, K., Schasberger, B.: The penn treebank: Annotating predicate argument structure. In: ARPA Human Language Technology Workshop, pp. 114\u2013119 (1994)","DOI":"10.3115\/1075812.1075835"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-14980-1_28","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"D. Rizo","year":"2010","unstructured":"Rizo, D., I\u00f1esta, J.M.: New partially labelled tree similarity measure: a case study. In: Hancock, E.R., Wilson, R.C., Windeatt, T., Ulusoy, I., Escolano, F. (eds.) SSPR&SPR 2010. LNCS, vol.\u00a06218, pp. 296\u2013305. Springer, Heidelberg (2010)"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-02518-1_12","volume-title":"Computer Music Modeling and Retrieval. Genesis of Meaning in Sound and Music","author":"D. Rizo","year":"2009","unstructured":"Rizo, D., Lemstr\u00f6m, K., I\u00f1esta, J.M.: Tree representation in combined polyphonic music comparison. In: Ystad, S., Kronland-Martinet, R., Jensen, K. (eds.) CMMR 2008. LNCS, vol.\u00a05493, pp. 177\u2013195. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"61_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences\u00a053(1-2), 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"key":"61_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/prot.340140216","volume":"14","author":"R.B. Russell","year":"2004","unstructured":"Russell, R.B., Barton, G.J.: Multiple protein sequence alignment from tertiary structure comparison: Assignment of global and residue confidence levels. Proteins: Structure, Function, and Bioinformatics\u00a014, 309\u2013323 (2004)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"issue":"2","key":"61_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv.\u00a016(2), 187\u2013260 (1984)","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"61_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S.M. Selkow","year":"1977","unstructured":"Selkow, S.M.: The tree-to-tree editing problem. Information Processing Letters\u00a06(6), 184\u2013186 (1977)","journal-title":"Information Processing Letters"},{"issue":"3","key":"61_CR17","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\u00a026(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"61_CR18","first-page":"212","volume-title":"International Symposium on String Processing and Information Retrieval","author":"G. Valiente","year":"2001","unstructured":"Valiente, G.: An efficient bottom-up distance between trees. In: International Symposium on String Processing and Information Retrieval, pp. 212\u2013219. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"6","key":"61_CR19","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(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21257-4_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T23:53:35Z","timestamp":1560297215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21257-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212567","9783642212574"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21257-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}