{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:30:29Z","timestamp":1725456629247},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647393"},{"type":"electronic","value":"9783540690542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0030782","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T02:49:24Z","timestamp":1133405364000},"page":"80-90","source":"Crossref","is-referenced-by-count":0,"title":["Efficient parallel algorithm for the editing distance between ordered trees"],"prefix":"10.1007","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M.J. Atallah, L.L. Larmore and S. Mcfaddin, \u2018Efficient parallel algorithms for string editing and related problems', SIAM J. Comput., vol. 19, no. 5, pp. 968\u2013988, 1990","journal-title":"SIAM J. Comput."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","volume":"1","author":"S. Y. Lu","year":"1979","unstructured":"S. Y. Lu, \u201cA tree-to-tree distance and its application to cluster analysis\u201d, IEEE Tracas. PAMI, vol. 1, pp.219\u2013224, 1979","journal-title":"IEEE Tracas. PAMI"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin, \u2018Fast parallel and serial approximate string matching', J. Algorithms, vol. 10, pp.157\u2013169, 1989","journal-title":"J. Algorithms"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"S. M. Selkow, \u2018The tree-to-tree editing problem', Information Processing Letters, no. 6, 184\u2013186, 1977","DOI":"10.1016\/0020-0190(77)90064-3"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"B. Shapiro, An algorithm for comparing multiple RNA secondary structures, Comput. Appl. Biosci., pp. 387\u2013393, 1988","DOI":"10.1093\/bioinformatics\/4.3.387"},{"issue":"4","key":"6_CR6","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"B. Shapiro and K. Zhang, \u2018Comparing multiple RNA secondary structures using tree comparisons\u2019 Comput. Appl. Biosci. vol. 6, no. 4, pp.309\u2013318, 1990","journal-title":"Comput. Appl. Biosci."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/0196-6774(90)90011-3","volume":"11","author":"D. Shasha","year":"1990","unstructured":"D. Shasha and K. Zhang, \u2018Fast algorithms for the unit cost edit distance between trees', J. of Algorithms, vol. 11, pp. 581\u2013621, 1990","journal-title":"J. of Algorithms"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. C. Tai","year":"1979","unstructured":"K. C. Tai, \u2018The tree-to-tree correction problem', J. ACM, vol. 26, pp.422\u2013433, 1979","journal-title":"J. ACM"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"K. Zhang, \u2018A new editing based distance between unordered labeled trees', In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science, 684, pp. 254\u2013265. Springer-Verlag, 1993; journal version is to appear in Algorithmica.","DOI":"10.1007\/BFb0029810"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"K. Zhang, \u2018Efficient parallel algorithms for tree editing problems', Proceedings of the Seventh Symposium on Combinatorial Pattern Matching","DOI":"10.1007\/3-540-61258-0_26"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"K. Zhang, J. Wang and D. Shasha, \u2018On the editing distance between undirected acyclic graphs', Proceedings of the Sixth Symposium on Combinatorial Pattern Matching, Helsinki, Finland, July 1995. Springer-Verlag's Lecture Notes in Computer Science 937, pp 395\u2013407.","DOI":"10.1007\/3-540-60044-2_58"},{"issue":"6","key":"6_CR12","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, \u2018Simple fast algorithms for the editing distance between trees and related problems', SIAM J. Computing vol. 18, no. 6, pp. 1245\u20131262, 1989","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T11:36:11Z","timestamp":1554723371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647393","9783540690542"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030782","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}