{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T03:28:38Z","timestamp":1768966118898,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642410611","type":"print"},{"value":"9783642410628","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41062-8_26","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T04:34:35Z","timestamp":1377837275000},"page":"257-265","source":"Crossref","is-referenced-by-count":14,"title":["Longest Common Subsequence in k Length Substrings"],"prefix":"10.1007","author":[{"given":"Gary","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avivit","family":"Levy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. Riva","family":"Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"26_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(86)90091-8","volume":"23","author":"L. Allison","year":"1986","unstructured":"Allison, L., Dix, T.I.: A bit-string Longest-Common-Subsequence. Information Processing Letters\u00a023(5), 305\u2013310 (1986)","journal-title":"Information Processing Letters"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jda.2010.02.001","volume":"8","author":"A. Amir","year":"2010","unstructured":"Amir, A., Gotthilf, Z., Shalom, R.: Weighted LCS. J. Discrete Algorithms\u00a08(3), 273\u2013281 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.tcs.2008.08.037","volume":"409","author":"A. Amir","year":"2008","unstructured":"Amir, A., Hartman, T., Kapah, O., Shalom, R., Tsur, D.: Generalized LCS. Theor. Comput. Sci.\u00a0409(3), 438\u2013449 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jcom.1998.0493","volume":"15","author":"A. Apostolico","year":"1999","unstructured":"Apostolico, A., Landau, G.M., Skiena, S.: Matching for run-length encoded strings. Journal of Complexity\u00a015(1), 4\u201316 (1999)","journal-title":"Journal of Complexity"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-38905-4_7","volume-title":"Combinatorial Pattern Matching","author":"G. Benson","year":"2013","unstructured":"Benson, G., Hernandez, Y., Loving, J.: A bit-parallel, general integer-scoring sequence alignment algorithm. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 50\u201361. Springer, Heidelberg (2013)"},{"key":"26_CR6","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proc, 7th Symposium on String Processing and Information Retrieval (SPIRE), pp. 39\u201348 (2000)"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-34109-0_14","volume-title":"String Processing and Information Retrieval","author":"G. Blin","year":"2012","unstructured":"Blin, G., Jiang, M., Vialette, S.: The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 130\u2013142. Springer, Heidelberg (2012)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-009-9262-5","volume":"21","author":"Y.C. Chen","year":"2011","unstructured":"Chen, Y.C., Chao: On the generalized constrained longest common subsequence problems. Journal of Combinatorial Optimization\u00a021(3), 383\u2013392 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"26_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0020-0190(01)00182-X","volume":"80","author":"M. Crochemore","year":"2001","unstructured":"Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm forthe longest common subsequence problem. Information Processing Letters\u00a080(6), 279\u2013285 (2001)","journal-title":"Information Processing Letters"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-16321-0_26","volume-title":"String Processing and Information Retrieval","author":"Z. Gotthilf","year":"2010","unstructured":"Gotthilf, Z., Hermelin, D., Landau, G.M., Lewenstein, M.: Restricted LCS. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 250\u2013257. Springer, Heidelberg (2010)"},{"key":"26_CR11","unstructured":"Hyyro, H.: Bit parallel LCS- length computation revisited. In: Proc. 15th Australasian Workshop on Combinatorial Algorithms, AWOCA (2004)"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.ic.2010.12.006","volume":"209","author":"G.M. Landau","year":"2011","unstructured":"Landau, G.M., Levy, A., Newman, I.: LCS approximation via embedding into locally non-repetitive strings. Inf. Comput.\u00a0209(4), 705\u2013716 (2011)","journal-title":"Inf. Comput."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-27801-6_13","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2004","unstructured":"Landau, G.M., Myers, E.W., Ziv-Ukelson, M.: Two Algorithms for LCS Consecutive Suffix Alignment. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 173\u2013193. Springer, Heidelberg (2004)"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-44888-8_17","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2003","unstructured":"Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Sparse LCS Common Substring Alignment. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 225\u2013236. Springer, Heidelberg (2003)"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1006\/jagm.2001.1191","volume":"41","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Ziv-Ukelson, M.: On the Common Substring Alignment Problem. J. Algorithms\u00a041(2), 338\u2013359 (2001)","journal-title":"J. Algorithms"},{"issue":"6","key":"26_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D.S. Hirschberg","year":"1975","unstructured":"Hirschberg, D.S.: A Linear space algorithm for Computing Maximal Common Subsequences. Commun. ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"Y.T. Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Information Processing Letters\u00a088(4), 173\u2013176 (2003)","journal-title":"Information Processing Letters"},{"key":"26_CR18","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"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41062-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T15:22:26Z","timestamp":1676820146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41062-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410611","9783642410628"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41062-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}