{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T13:10:04Z","timestamp":1743858604949,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_15","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"163-175","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Forest Local Similarity"],"prefix":"10.1007","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","reference":[{"key":"15_CR1","unstructured":"Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible markup language (XML) 1.0. W3C Recommendation\u00a06 (2000)"},{"issue":"24-25","key":"15_CR2","doi-asserted-by":"publisher","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.: On the similarity metric and the distance metric. Theor. Comput. Sci.\u00a0410(24-25), 2365\u20132376 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An Optimal Decomposition Algorithm for Tree Edit Distance. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 146\u2013157. Springer, Heidelberg (2007)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"H\u00f6chsmann, M., T\u00f6ller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: Proceedings of the IEEE Computational Systems Bioinformatics Conference, pp. 159\u2013168 (2003)","DOI":"10.1109\/CSB.2003.1227315"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1089\/cmb.2006.13.702","volume":"13","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Hieu, N.T., Sung, W.K.: Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. Journal of Computational Biology\u00a013(3), 702\u2013718 (2006)","journal-title":"Journal of Computational Biology"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/11780441_34","volume-title":"Combinatorial Pattern Matching","author":"J. Jansson","year":"2006","unstructured":"Jansson, J., Peng, Z.: Algorithms for Finding a Most Similar Subforest. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 377\u2013388. Springer, Heidelberg (2006)"},{"key":"15_CR7","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 - an alternative to tree edit. Theoretical Computer Science\u00a0143, 137\u2013148 (1995)","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","unstructured":"Motifs database, http:\/\/subviral.med.uottawa.ca\/cgi-bin\/motifs.cgi"},{"key":"15_CR9","unstructured":"Liang, Z.: Efficient Algorithms for Local Forest Similarity. Thesis(M.Sc), School of Graduate and Postdoctoral Studies, University of Western Ontario, London, Ontario, Canada (2011)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/11602613_71","volume-title":"Algorithms and Computation","author":"Z. Peng","year":"2005","unstructured":"Peng, Z.: Algorithms for Local Forest Similarity. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 704\u2013713. Springer, Heidelberg (2005)"},{"issue":"4","key":"15_CR11","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences\u00a06(4), 309\u2013318 (1990)","journal-title":"Computer Applications in the Biosciences"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology\u00a0147(1), 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"issue":"8","key":"15_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/34.709622","volume":"20","author":"J. Wang","year":"1998","unstructured":"Wang, J., Shapiro, B.A., Shasha, D., Zhang, K., Currey, K.M.: An algorithm for finding the largest approximately common substructures of two trees. IEEE Trans. Pattern Anal. Mach. Intell.\u00a020(8), 889\u2013895 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"15_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":"15_CR15","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 Journal on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13509-5_1","volume-title":"Combinatorial Pattern Matching","author":"K. Zhang","year":"2010","unstructured":"Zhang, K., Zhu, Y.: Algorithms for Forest Pattern Matching. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 1\u201312. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T12:29:57Z","timestamp":1743856197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}