{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:28Z","timestamp":1725573448241},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_39","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"380-391","source":"Crossref","is-referenced-by-count":1,"title":["Space Efficient Algorithms for Ordered Tree Comparison"],"prefix":"10.1007","author":[{"given":"Lusheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science\u00a0(337), 217\u2013239 (2005)","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/TPAMI.1985.4767658","volume":"7","author":"Y.C. Cheng","year":"1985","unstructured":"Cheng, Y.C., Lu, S.Y.: Waveform correlation by tree matching. IEEE Trans. PAMI\u00a07, 299\u2013305 (1985)","journal-title":"IEEE Trans. PAMI"},{"key":"39_CR3","unstructured":"Dulucq, S., Touzet, H.: Decomposition algorithm for tree editing distance. Journal of Discrete Algorithms (2004)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Communications of the ACM\u00a0(18), 341\u2013343 (1975)","DOI":"10.1145\/360825.360861"},{"issue":"1","key":"39_CR5","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 - an alternative to tree edit. Theoretical Computer Science\u00a0143(1), 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"39_CR6","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 - ESA \u201998","author":"P. Klein","year":"1998","unstructured":"Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 91\u2013102. Springer, Heidelberg (1998)"},{"key":"39_CR7","unstructured":"Richter, T.: A new measure of the distance between ordered trees and its applications. Technical Report 85166-cs, Department of Computer Science, University of Bonn (1997)"},{"issue":"4","key":"39_CR8","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"Shapiro, B., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci.\u00a06(4), 309\u2013318 (1990)","journal-title":"Comput. Appl. Biosci."},{"key":"39_CR9","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, 184\u2013186 (1977)","journal-title":"Information Processing Letters"},{"key":"39_CR10","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, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1093\/bioinformatics\/btg305","volume":"19","author":"L. Wang","year":"2003","unstructured":"Wang, L., Zhao, J.: Parametric alignment of ordered trees. Bioinformatics\u00a019, 2237\u20132245 (2003)","journal-title":"Bioinformatics"},{"issue":"3","key":"39_CR12","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":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-61258-0_26","volume-title":"Combinatorial Pattern Matching","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: Efficient parallel algorithms for tree editing problems. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 361\u2013372. Springer, Heidelberg (1996)"},{"issue":"6","key":"39_CR14","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. Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Computing"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-48452-3_21","volume-title":"Combinatorial Pattern Matching","author":"K. Zhang","year":"1999","unstructured":"Zhang, K., Wang, L., Ma, B.: Computing similarity between RNA structures. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 281\u2013293. Springer, Heidelberg (1999)"},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1142\/S0129054196000051","volume":"7","author":"K. Zhang","year":"1996","unstructured":"Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science\u00a07(1), 43\u201357 (1996)","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:50Z","timestamp":1619506970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11602613_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}