{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:12:23Z","timestamp":1649023943749},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T00:00:00Z","timestamp":1365465600000},"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,1]]},"DOI":"10.1007\/s10878-013-9613-0","type":"journal-article","created":{"date-parts":[[2013,4,8]],"date-time":"2013-04-08T05:56:08Z","timestamp":1365400568000},"page":"14-31","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for local similarity between forests"],"prefix":"10.1007","volume":"27","author":[{"given":"Zhewei","family":"Liang","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":[[2013,4,9]]},"reference":[{"key":"9613_CR1","unstructured":"Bray T, Paoli J, Sperberg-McQueen CM, Maler E, Yergeau F (2000) Extensible markup language (XML) 1.0. W3C recommendation, 6"},{"key":"9613_CR2","first-page":"300C307","volume":"1","author":"S Cha","year":"2007","unstructured":"Cha S (2007) Comprehensive survey on distance\/similarity measures between probability density functions. Int J Math Models Meth Appl Sci 1:300C307","journal-title":"Int J Math Models Meth Appl Sci"},{"issue":"24\u201325","key":"9613_CR3","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.1016\/j.tcs.2009.02.023","volume":"410","author":"S Chen","year":"2009","unstructured":"Chen S, Ma B, Zhang K (2009) On the similarity metric and the distance metric. Theory Comput Sci 410(24\u201325):2365\u20132376","journal-title":"Theory Comput Sci"},{"key":"9613_CR4","doi-asserted-by":"crossref","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2007) An optimal decomposition algorithm for tree edit distance. In Proceedings of the 34th international colloquium on automata, languages and programming (ICALP), pp 146\u2013157","DOI":"10.1007\/978-3-540-73420-8_15"},{"key":"9613_CR5","doi-asserted-by":"crossref","unstructured":"H\u00f6chsmann M, T\u00f6ller T, Giegerich R, Kurtz S (2003) Local similarity in RNA secondary structures. In Proceedings of the IEEE Computational systems bioinformatics conference, pp 159\u2013168","DOI":"10.1109\/CSB.2003.1227315"},{"issue":"3","key":"9613_CR6","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1089\/cmb.2006.13.702","volume":"13","author":"J Jansson","year":"2006","unstructured":"Jansson J, Hieu NT, Sung WK (2006) Local gapped subforest alignment and its application in finding RNA structural motifs. J Comput Biol 13(3):702\u2013718","journal-title":"J Comput Biol"},{"key":"9613_CR7","doi-asserted-by":"crossref","unstructured":"Jansson J, Peng Z (2006) Algorithms for Finding a Most Similar Subforest. In Proceedings of the 17th symposium on combinatorial pattern matching, pp 377\u2013388","DOI":"10.1007\/11780441_34"},{"key":"9613_CR8","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 (1995) Alignment of trees\u2014an alternative to tree edit. Theor Comput Sci 143:137\u2013148","journal-title":"Theor Comput Sci"},{"key":"9613_CR9","doi-asserted-by":"crossref","unstructured":"Liang Z (2011) Efficient algorithms for local forest similarity. Thesis(M.Sc), School of Graduate and Postdoctoral Studies, University of Western Ontario, London","DOI":"10.1007\/978-3-642-31770-5_15"},{"key":"9613_CR10","unstructured":"Motifs database. http:\/\/subviral.med.uottawa.ca\/cgi-bin\/motifs.cgi"},{"key":"9613_CR11","doi-asserted-by":"crossref","unstructured":"Peng Z (2005) Algorithms for local forest similarity. In Proceedings of the 16th international symposium on algorithms and computation (ISAAC), pp 704\u2013713","DOI":"10.1007\/11602613_71"},{"issue":"4","key":"9613_CR12","first-page":"309","volume":"6","author":"BA Shapiro","year":"1990","unstructured":"Shapiro BA, Zhang K (1990) Comparing multiple RNA secondary structures using tree comparisons. Comput Appl Biosci 6(4):309\u2013318","journal-title":"Comput Appl Biosci"},{"issue":"1","key":"9613_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1981","unstructured":"Smith TF, Waterman MS (1981) Identification of common molecular subsequences. J Mol Biol 147(1):195\u2013197","journal-title":"J Mol Biol"},{"issue":"3","key":"9613_CR14","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K-C Tai","year":"1979","unstructured":"Tai K-C (1979) The tree-to-tree correction problem. J Assoc Comput Mach 26(3):422\u2013433","journal-title":"J Assoc Comput Mach"},{"issue":"8","key":"9613_CR15","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/34.709622","volume":"20","author":"J Wang","year":"1998","unstructured":"Wang J, Shapiro BA, Shasha D, Zhang K, Currey KM (1998) An algorithm for finding the largest approximately common substructures of two trees. IEEE Trans Pattern Anal Mach Intell 20(8):889\u2013895","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9613_CR16","doi-asserted-by":"crossref","unstructured":"Zhang K (1998) Computing similarity between RNA secondary structures. In Proceedings of IEEE international joint symposia on intelligence and systems, Rockville, Maryland, pp 126\u2013132","DOI":"10.1109\/IJSIS.1998.685429"},{"issue":"6","key":"9613_CR17","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"},{"key":"9613_CR18","doi-asserted-by":"crossref","unstructured":"Zhang K, Zhu Y (2010) Algorithms for forest pattern matching. In Proceedings of the 21th symposium on combinatorial pattern matching (CPM), pp 1\u201312","DOI":"10.1007\/978-3-642-13509-5_1"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9613-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9613-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9613-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T01:23:09Z","timestamp":1595640189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9613-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9613"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9613-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,9]]}}}