{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:18:07Z","timestamp":1725491887575},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_5","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"50-61","source":"Crossref","is-referenced-by-count":5,"title":["Generalized LCS"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzvika","family":"Hartman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oren","family":"Kapah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Riva","family":"Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dekel","family":"Tsur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"Amir, A., Landau, G.M.: Fast Parallel and Serial Multidimensional Aproximate Array Matching. Theor. Comput. Sci.\u00a081(1), 97\u2013115 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-68535-9_36","volume-title":"Computing and Combinatorics","author":"R. Baeza-Yates","year":"1998","unstructured":"Baeza-Yates, R.: Similarity in Two-dimensional strings. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol.\u00a01449, pp. 319\u2013328. Springer, Heidelberg (1998)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE 2000, pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"issue":"1-3","key":"5_CR4","doi-asserted-by":"publisher","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. TCS\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"TCS"},{"key":"5_CR5","volume-title":"Introduction to Protein Structure","author":"C. Branden","year":"1999","unstructured":"Branden, C., Tooze, J.: Introduction to Protein Structure. Garland Publishing, New York (1999)"},{"key":"5_CR6","unstructured":"Demaine, E., Mozes, S., Rossman, B., Weimann, O.: An O(n3)-time algorithm for tree edit distance (submitted)"},{"key":"5_CR7","unstructured":"Farach, M., Przytycka, T.M., Thorup, M.: The Maximum Agreement Subtree Problem for Binary Trees. In: Proc. of the second ESA (1995)"},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: space algorithm for Computing Maximal Common Subsequences. Commun. ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpelinen","year":"1995","unstructured":"Kilpelinen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal on Computing\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-68530-8_8","volume-title":"Algorithms \u2014 ESA\u2019 98","author":"Philip N. Klein","year":"1998","unstructured":"Klein, P.N.: Computing the edit distance between unrooted ordered trees. In: ESA 1998, pp. 91\u2013102 (1998)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpelinen","year":"1995","unstructured":"Kilpelinen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal on Computing\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0255(87)90037-5","volume":"43","author":"K. Krithivasan","year":"1987","unstructured":"Krithivasan, K., Sitalakshmi, R.: Efficient two-dimensional pattern matching in the presence of errors. Informatio Sciences\u00a043(3), 169\u2013184 (1987)","journal-title":"Informatio Sciences"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-27801-6_5","volume-title":"Combinatorial Pattern Matching","author":"R.Y. Pinter","year":"2004","unstructured":"Pinter, R.Y., Rokhlenko, O., Tsur, D., Ziv-Ukelson, M.: Approximate labelled subtree homeomorphism. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 59\u201373. Springer, Heidelberg (2004)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-63220-4_57","volume-title":"Combinatorial Pattern Matching","author":"T. Richter","year":"1997","unstructured":"Richter, T.: A new algorithm for the ordered tree inclusion problem. In: Hein, J., Apostolico, A. (eds.) Combinatorial Pattern Matching. LNCS, vol.\u00a01264, pp. 150\u2013166. Springer, Heidelberg (1997)"},{"issue":"4","key":"5_CR15","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.Z.: 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":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"D. Shasha","year":"1989","unstructured":"Shasha, D., Zhang, K.: Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM J. Comput.\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2116\/analsci.3.23","volume":"3","author":"Y. Takahashi","year":"1987","unstructured":"Takahashi, Y., Satoh, Y., Suzuki, H., Sasaki, S.: Recognition of largest common structural fragment among a variety of chemical structures. Analytical sciences\u00a03, 23\u201328 (1987)","journal-title":"Analytical sciences"},{"issue":"2-4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.jda.2004.08.017","volume":"3","author":"G. Valiente","year":"2005","unstructured":"Valiente, G.: Constrained tree inclusion. J. Discrete Algorithms\u00a03(2-4), 431\u2013447 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM\u00a021, 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0031-3203(94)00109-Y","volume":"28","author":"K. Zhang","year":"1995","unstructured":"Zhang, K.: Algorithm for the constrained editing problem between ordered labeled trees and related problems. Pattern Recognition\u00a028, 463\u2013478 (1995)","journal-title":"Pattern Recognition"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: A Constrained Edit Distance Between Unordered Labeled Trees. Algorithmica\u00a015(3), 205\u2013222 (1996)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:26:39Z","timestamp":1605763599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_5","relation":{},"subject":[]}}