{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:44:55Z","timestamp":1725497095818},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77226-2_65","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"643-652","source":"Crossref","is-referenced-by-count":0,"title":["A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance"],"prefix":"10.1007","author":[{"given":"Hisashi","family":"Koga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroaki","family":"Saito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshinori","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takanori","family":"Yokoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1089\/10665270050081522","volume":"7","author":"V. Moulton","year":"2000","unstructured":"Moulton, V., Zuker, M., Steel, M., Pointon, R., Penny, D.: Metrics on RNA Secondary Structures. J. of Computational Biology\u00a07, 277\u2013292 (2000)","journal-title":"J. of Computational Biology"},{"key":"65_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. Theoretical Computer Science\u00a0337, 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"65_CR3","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. on Computing\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. on Computing"},{"key":"65_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D. Shasha","year":"1990","unstructured":"Shasha, D., Zhang, K.: Fast Algorithms for the Unit Cost Editing Distance between Trees. J. of Algorithms\u00a011, 581\u2013621 (1990)","journal-title":"J. of Algorithms"},{"issue":"9","key":"65_CR5","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1109\/34.955108","volume":"23","author":"B.J. Oommen","year":"2001","unstructured":"Oommen, B.J., Loke, R.K.S.: On the Pattern Recognition of Noisy Subsequence Trees. IEEE Trans. on PAMI\u00a023(9), 929\u2013946 (2001)","journal-title":"IEEE Trans. on PAMI"},{"key":"65_CR6","unstructured":"Schlieder, T., Naumann, F.: Approximate Tree Embedding for Querying XML Data. In: Proc. of ACM SIGIR Workshop on XML and Information Retrieval (2000)"},{"key":"65_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-27801-6_5","volume-title":"Combinatorial Pattern Matching","author":"R.Y. Pinter","year":"2004","unstructured":"Pinter, R.Y., Rokhlenko, O., Tsur, D., Ziv-Ukelson, M.: Approximate Labelled Subtree Homeomorphism. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 59\u201373. Springer, Heidelberg (2004)"},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/11547273_14","volume-title":"Database and XML Technologies","author":"I. Sanz","year":"2005","unstructured":"Sanz, I., Mesiti, M., Guerrini, G., Llavori, R.B.: Approximate Subtree Identification in Heterogeneous XML Documents Collections. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahs\u00e8ne, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol.\u00a03671, pp. 192\u2013206. Springer, Heidelberg (2005)"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A Graph Distance Metric based on the Maximal Common Subgraph. Pattern Recognition Letters\u00a019, 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"65_CR10","unstructured":"http:\/\/sd.is.uec.ac.jp\/~koga\/IDEALdata.html"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning - IDEAL 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77226-2_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:05:21Z","timestamp":1619521521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77226-2_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772255"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77226-2_65","relation":{},"subject":[]}}