{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:32:04Z","timestamp":1710361924672},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,1,15]],"date-time":"2008-01-15T00:00:00Z","timestamp":1200355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00453-007-9100-z","type":"journal-article","created":{"date-parts":[[2008,1,14]],"date-time":"2008-01-14T17:06:35Z","timestamp":1200330395000},"page":"283-297","source":"Crossref","is-referenced-by-count":6,"title":["Space Efficient Algorithms for Ordered Tree Comparison"],"prefix":"10.1007","volume":"51","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","published-online":{"date-parts":[[2008,1,15]]},"reference":[{"key":"9100_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 337, 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9100_CR2","unstructured":"Chodorow, M., Klavans, J.L.: Locating syntactic patterns in text corpora. Manuscript, Lexical systems, IBM Research, T.J. Watson Research Center, Yorktown Heights, New York (1990)"},{"key":"9100_CR3","unstructured":"Dulucq, S., Touzet, H.: Decomposition algorithm for tree editing distance. J.\u00a0Discrete Algorithms (2004)"},{"key":"9100_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18, 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"issue":"1","key":"9100_CR5","doi-asserted-by":"crossref","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\u2014an alternative to tree edit. Theor. Comput. Sci. 143(1), 137\u2013148 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9100_CR6","doi-asserted-by":"crossref","unstructured":"Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of 6th European Symposium on Algorithms, pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"key":"9100_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":"9100_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. 6(4), 309\u2013318 (1990)","journal-title":"Comput. Appl. Biosci."},{"key":"9100_CR9","doi-asserted-by":"crossref","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. Inf. Process. Lett. 6, 184\u2013186 (1977)","journal-title":"Inf. Process. Lett."},{"key":"9100_CR10","doi-asserted-by":"crossref","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 26, 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"9100_CR11","doi-asserted-by":"crossref","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 19, 2237\u20132245 (2003)","journal-title":"Bioinformatics"},{"issue":"3","key":"9100_CR12","doi-asserted-by":"crossref","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 Recognit. 28(3), 463\u2013474 (1995)","journal-title":"Pattern Recognit."},{"key":"9100_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":"Proceedings of the Seventh Symposium on Combinatorial Pattern Matching","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: Efficient parallel algorithms for tree editing problems. In: Proceedings of the Seventh Symposium on Combinatorial Pattern Matching, Laguna Beach, California, June 1996. Lecture Notes in Computer Science, vol. 1075, pp. 361\u2013372. Springer, Berlin (1996)"},{"key":"9100_CR14","unstructured":"Zhang, K.: Computing similarity between RNA secondary structures. In: Proceedings of IEEE International Joint Symposia on Intelligence and Systems, Rockville, Maryland, pp. 126\u2013132 (May 1998)"},{"issue":"6","key":"9100_CR15","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. SIAM J. Comput. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9100_CR16","doi-asserted-by":"crossref","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. Int. J. Found. Comput. Sci. 7(1), 43\u201357 (1996)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9100-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9100-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9100-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9100-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,15]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9100"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9100-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,15]]}}}