{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:46Z","timestamp":1759638886359},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_26","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:08:27Z","timestamp":1129802907000},"page":"323-337","source":"Crossref","is-referenced-by-count":7,"title":["A Theoretical Analysis of Alignment and Edit Problems for Trees"],"prefix":"10.1007","author":[{"given":"Tetsuji","family":"Kuboyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kilho","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Yasuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/bioinformatics\/btg1032","volume":"19","author":"Y. Sakakibara","year":"2003","unstructured":"Sakakibara, Y.: Pair hidden markov models on tree structures. Bioinformatics\u00a019, 232\u2013240 (2003)","journal-title":"Bioinformatics"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/3-540-47977-5_54","volume-title":"Computer Vision - ECCV 2002","author":"A. Torsello","year":"2002","unstructured":"Torsello, A., Hancock, E.R.: Matching and embedding through edit-union of trees. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 822\u2013836. Springer, Heidelberg (2002)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1051\/forest:2000134","volume":"57","author":"P. Ferraro","year":"2000","unstructured":"Ferraro, P., Godin, C.: A distance measure between plant architectures. Annals of Forest Science\u00a057, 445\u2013461 (2000)","journal-title":"Annals of Forest Science"},{"doi-asserted-by":"crossref","unstructured":"Hogue, A., Karger, D.: Thresher: Automating the unwrapping of semantic content from the world wide web. In: Proc. of WWW 2005, pp. 86\u201395 (2005)","key":"26_CR4","DOI":"10.1145\/1060745.1060762"},{"issue":"3","key":"26_CR5","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. Journal of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the ACM"},{"issue":"6","key":"26_CR6","doi-asserted-by":"crossref","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. SICOMP\u00a018(6), 1245\u20131262 (1989)","journal-title":"SICOMP"},{"key":"26_CR7","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 \u2014 an alternative to tree edit. Theoretical Computer Science\u00a0143, 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. Journal of the ACM\u00a021, 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"key":"26_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"26_CR10","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":"26_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":"C.L. Lu","year":"2001","unstructured":"Lu, C.L., Su, Z.Y., Tang, G.Y.: A new measure of edit distance between labeled trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 338\u2013348. Springer, Heidelberg (2001)"},{"key":"26_CR12","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\u00a015, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"26_CR13","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 Recognition\u00a028(3), 463\u2013474 (1995)","journal-title":"Pattern Recognition"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1142\/S0218001488000157","volume":"2","author":"E. Tanaka","year":"1988","unstructured":"Tanaka, E., Tanaka, K.: The tree-to-tree editing problem. International Journal of Pattern Recognition and Artificial Intelligence\u00a02, 221\u2013240 (1988)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"unstructured":"Richter, T.: A new measure of the distance between ordered trees and its applications. Technical Report 85166-CS, Dept. of Computer Science, Univ. of Bonn (1997)","key":"26_CR15"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0031-3203(99)00199-5","volume":"34","author":"J.L. Wang","year":"2001","unstructured":"Wang, J.L., Zhang, K.: Finding similar consensus between trees: an algorithm and a distance hierarchy. Pattern Recognition\u00a034, 127\u2013137 (2001)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:13:18Z","timestamp":1619493198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11560586_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}