{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:44Z","timestamp":1759638224265},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540690665"},{"type":"electronic","value":"9783540690689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69068-9_24","type":"book-chapter","created":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T05:54:28Z","timestamp":1212818068000},"page":"255-262","source":"Crossref","is-referenced-by-count":19,"title":["Constrained LCS: Hardness and Approximation"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Gotthilf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Hermelin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"24_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"},{"issue":"6","key":"24_CR2","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":"24_CR3","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"},{"issue":"4","key":"24_CR4","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":"24_CR5","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":"24_CR6","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":"24_CR7","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":"2","key":"24_CR8","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":"24_CR9","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":"24_CR10","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","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69068-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:24:50Z","timestamp":1620015890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69068-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540690665","9783540690689"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69068-9_24","relation":{},"subject":[]}}