{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:17:58Z","timestamp":1771701478336,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10878-012-9552-1","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T13:37:51Z","timestamp":1349962671000},"page":"778-797","source":"Crossref","is-referenced-by-count":5,"title":["An improved algorithm for tree edit distance with applications for RNA secondary structure comparison"],"prefix":"10.1007","volume":"27","author":[{"given":"Shihyen","family":"Chen","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":[[2012,10,12]]},"reference":[{"key":"9552_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A Aggarwal","year":"1987","unstructured":"Aggarwal A, Klawe MM, Moran S, Shor P, Wilber R (1987) Geometric applications of a matrix-searching algorithm. Algorithmica 2:195\u2013208","journal-title":"Algorithmica"},{"issue":"5","key":"9552_CR2","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A Apostolico","year":"1990","unstructured":"Apostolico A, Atallah MJ, Larmore LL, McFaddin HS (1990) Efficient parallel algorithms for string editing and related problems. SIAM J Comput 19(5):968\u2013988","journal-title":"SIAM J Comput"},{"key":"9552_CR3","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 (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337:217\u2013239","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9552_CR4","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/1644015.1644017","volume":"6","author":"ED Demaine","year":"2009","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2009) An optimal decomposition algorithm for tree edit distance. ACM Trans Algorithms 6(1):2:1\u20132:19","journal-title":"ACM Trans Algorithms"},{"key":"9552_CR5","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jda.2004.08.018","volume":"3","author":"S Dulucq","year":"2005","unstructured":"Dulucq S, Touzet H (2005) Decomposition algorithms for the tree edit distance problem. J Discrete Algorithms 3:448\u2013471","journal-title":"J Discrete Algorithms"},{"issue":"2","key":"9552_CR6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestors. SIAM J Comput 13(2):338\u2013355","journal-title":"SIAM J Comput"},{"key":"9552_CR7","first-page":"91","volume-title":"Proceedings of the 6th European symposium on algorithms (ESA)","author":"PN Klein","year":"1998","unstructured":"Klein PN (1998) Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th European symposium on algorithms (ESA), pp 91\u2013102"},{"key":"9552_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1146\/annurev.biochem.68.1.287","volume":"68","author":"PB Moore","year":"1999","unstructured":"Moore PB (1999) Structural motifs in RNA. Annu Rev Biochem 68:287\u2013300","journal-title":"Annu Rev Biochem"},{"key":"9552_CR9","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator DD, Tarjan RE (1983) A data structure for dynamic trees. J Comput Syst Sci 26:362\u2013391","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"9552_CR10","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K Tai","year":"1979","unstructured":"Tai K (1979) The tree-to-tree correction problem. J ACM 26(3):422\u2013433","journal-title":"J ACM"},{"issue":"1","key":"9552_CR11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J ACM 21(1):168\u2013173","journal-title":"J ACM"},{"issue":"6","key":"9552_CR12","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9552-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9552-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9552-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:19Z","timestamp":1559262199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9552-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9552"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9552-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}