{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:12Z","timestamp":1725493452885},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_30","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"309-311","source":"Crossref","is-referenced-by-count":3,"title":["The Constrained Longest Common Subsequence Problem for Degenerate Strings"],"prefix":"10.1007","author":[{"given":"Costas","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Vor\u00e1\u010dek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Vagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","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":"6","key":"30_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. Int. J. Found. Comput. Sci.\u00a016(6), 1099\u20131109 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"30_CR3","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 common subsequence problem. Inf. Process. Lett.\u00a088, 173\u2013176 (2003)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:13Z","timestamp":1619520493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_30","relation":{},"subject":[]}}