{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:49Z","timestamp":1725563509024},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_28","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T06:05:23Z","timestamp":1282975523000},"page":"296-305","source":"Crossref","is-referenced-by-count":1,"title":["New Partially Labelled Tree Similarity Measure: A Case Study"],"prefix":"10.1007","author":[{"given":"David","family":"Rizo","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 M.","family":"I\u00f1esta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"28_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":"28_CR2","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":"28_CR3","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":"28_CR4","unstructured":"Illescas, P.R., Rizo, D., I\u00f1esta, J.M.: Harmonic, melodic, and functional automatic analysis. In: Proceedings of the 2007 International Computer Music Conferrence, vol.\u00a0I, pp. 165\u2013168 (2007)"},{"key":"28_CR5","unstructured":"Isert, C.: The editing distance between trees. Technical report, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen (1999)"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80015-8","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":"28_CR7","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"},{"key":"28_CR8","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":"28_CR9","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)"},{"key":"28_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1007\/978-3-540-44871-6_97","volume-title":"Pattern Recognition and Image Analysis","author":"D. Rizo","year":"2003","unstructured":"Rizo, D., Moreno-Seco, F., JI\u00f1esta, J.M.: Tree-structured representation of musical information. In: Perales, F.J., Campilho, A.C., P\u00e9rez, N., Sanfeliu, A. (eds.) IbPRIA 2003. LNCS (LNAI), vol.\u00a02652, pp. 838\u2013846. Springer, Heidelberg (2003)"},{"key":"28_CR11","doi-asserted-by":"crossref","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":"6","key":"28_CR12","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":"28_CR13","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":"28_CR14","doi-asserted-by":"crossref","unstructured":"Valiente, G.: An efficient bottom-up distance between trees. International Symposium on String Processing and Information Retrieval, 0,212 (2001)","DOI":"10.1109\/SPIRE.2001.989761"},{"issue":"6","key":"28_CR15","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","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14980-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:00:01Z","timestamp":1606168801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}