{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:53Z","timestamp":1759638113882,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_26","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:51:32Z","timestamp":1286290292000},"page":"250-257","source":"Crossref","is-referenced-by-count":21,"title":["Restricted LCS"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Gotthilf","sequence":"first","affiliation":[]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"Aho, A.V., Hirschberg, D.S., Ullman, J.D.: Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the ACM\u00a023(1), 1\u201312 (1976)","journal-title":"Journal of the ACM"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-75530-2_5","volume-title":"String Processing and Information Retrieval","author":"A. Amir","year":"2007","unstructured":"Amir, A., Hartman, T., Kapah, O., Shalom, B.R., Tsur, D.: Generalized LCS. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 50\u201361. Springer, Heidelberg (2007)"},{"key":"26_CR3","unstructured":"Andrejkova, G.: The Longest Restricted Common Subsequence Problem. In: Proceedings, Prague Stringology Club Workshop 1998, pp. 14\u201325 (1998)"},{"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"},{"issue":"6","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1142\/S0129054105003674","volume":"16","author":"A.N. Arslan","year":"2005","unstructured":"Arslan, A.N., Egecioglu, \u00d6.: Algorithms For The Constrained Longest Common Subsequence Problems. International Journal of Foundations of Computer Science\u00a016(6), 1099\u20131109 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A Survey of Longest Common Subsequence Algorithms. In: Proc. SPIRE 2000, pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"26_CR7","unstructured":"Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. Electronic Colloquium on Computational Complexity\u00a05(29) (1998)"},{"key":"26_CR8","unstructured":"Chen, Y.C., Chao, K.M.: On the generalized constrained longest common subsequence problems. Journal of Combinatorial Optimization, 1\u201310 (2009)"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.02.008","volume":"90","author":"F.Y.L. Chin","year":"2004","unstructured":"Chin, F.Y.L., De Santis, A., Ferrara, A.L., Ho, N.L., Kim, S.K.: A simple algorithm for the constrained sequence problems. Information Processing Letters\u00a090(4), 175\u2013179 (2004)","journal-title":"Information Processing Letters"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-69068-9_24","volume-title":"Combinatorial Pattern Matching","author":"Z. Gotthilf","year":"2008","unstructured":"Gotthilf, Z., Hermelin, D., Lewenstein, M.: Constrained LCS: Hardness and Approximation. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 255\u2013262. Springer, Heidelberg (2008)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-75530-2_15","volume-title":"String Processing and Information Retrieval","author":"Z. Gotthilf","year":"2007","unstructured":"Gotthilf, Z., Lewenstein, M.: Approximating Constrained LCS. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 164\u2013172. Springer, Heidelberg (2007)"},{"issue":"6","key":"26_CR12","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. Communications of the ACM\u00a018(6), 341\u2013343 (1975)","journal-title":"Communications of the ACM"},{"issue":"4","key":"26_CR13","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the Longest Common Subsequence Problem. Journal of the ACM\u00a024(4), 664\u2013675 (1977)","journal-title":"Journal of the ACM"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2007.09.008","volume":"106","author":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the LCS and constrained LCS problems. Information Processing Letters\u00a0106(1), 13\u201318 (2008)","journal-title":"Information Processing Letters"},{"key":"26_CR15","unstructured":"Iliopoulos, C.S., Rahman, M.S., Rytter, W.: Algorithms for two versions of the lcs problem for indeterminate strings. Journal of Combinatorial Mathematics and Combinatorial Computing (2008)"},{"issue":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The Complexity of Some Problems on Subsequences and Supersequences. Journal of the ACM\u00a025(2), 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A Faster Algorithm Computing String Edit Distances. Journal of Computer and System Sciences\u00a020(1), 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"26_CR18","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"}],"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-642-16321-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T06:57:43Z","timestamp":1740553063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}