{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:17:53Z","timestamp":1725491873709},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_15","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"164-172","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Constrained LCS"],"prefix":"10.1007","author":[{"given":"Zvi","family":"Gotthilf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"15_CR1","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1142\/S0129054105003674","volume":"16","author":"A.N. Arslan","year":"2005","unstructured":"Arslan, A.N., Egecioglu, O.: Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci.\u00a016(6), 1099\u20131109 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR2","volume-title":"SPIRE 2000","author":"L. Bergroth","year":"2000","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE 2000, IEEE Computer Society Press, Washington, DC, USA (2000)"},{"issue":"4","key":"15_CR3","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. Inf. Process. Lett.\u00a090(4), 175\u2013179 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"E.W. Myers","year":"1998","unstructured":"Myers, E.W., Landau, G.M., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput\u00a027(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput"},{"issue":"6","key":"15_CR5","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":"15_CR6","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. J. ACM\u00a024(4), 664\u2013675 (1977)","journal-title":"J. ACM"},{"key":"15_CR7","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.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci.\u00a020, 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"15_CR8","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. Inf. Process. Lett.\u00a088(4), 173\u2013176 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"J.D. Ullman","year":"1976","unstructured":"Ullman, J.D., Aho, A.V., Hirschberg, D.S.: Bounds on the complexity of the longest common subsequence problem. J. ACM\u00a023(1), 1\u201312 (1976)","journal-title":"J. ACM"}],"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_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:17Z","timestamp":1619518997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_15","relation":{},"subject":[]}}