{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:45:09Z","timestamp":1743011109026,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493892"},{"type":"electronic","value":"9783662493908"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49390-8_25","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:17:15Z","timestamp":1457374635000},"page":"261-267","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for a New Constrained LCS Problem"],"prefix":"10.1007","author":[{"given":"Daxin","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yingjie","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-009-9262-5","volume":"21","author":"YC Chen","year":"2011","unstructured":"Chen, Y.C., Chao, K.M.: On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3), 383\u2013392 (2011)","journal-title":"J. Comb. Optim."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"RA Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences. Theoret. Comput. Sci. 78, 363\u2013376 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"25_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ipl.2012.02.007","volume":"112","author":"S Deorowicz","year":"2012","unstructured":"Deorowicz, S.: Quadratic-time algorithm for a string constrained LCS problem. Inf. Process. Lett. 112(11), 423\u2013426 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"25_CR4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.3233\/FI-2010-256","volume":"99","author":"S Deorowicz","year":"2010","unstructured":"Deorowicz, S.: Bit-parallel algorithm for the constrained longest common subsequence problem. Fundamenta Informaticae 99(4), 409\u2013433 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"DS Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24, 664\u2013675 (1977)","journal-title":"J. ACM"},{"key":"25_CR6","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. 5029, pp. 255\u2013262. Springer, Heidelberg (2008)"},{"key":"25_CR7","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. 6393, pp. 250\u2013257. Springer, Heidelberg (2010)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S012905411000712X","volume":"21","author":"YH Peng","year":"2010","unstructured":"Peng, Y.H., Yang, C.B., Huang, K.S., Tseng, K.T.: An algorithm and applications to sequence alignment with weighted constraints. Int. J. Found. Comput. Sci. 21(1), 51\u201359 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0219720003000095","volume":"1","author":"CY Tang","year":"2003","unstructured":"Tang, C.Y., Lu, C.L.: Constrained multiple sequence alignment tool development and its application to RNase family alignment. J. Bioinform. Comput. Biol. 1, 267\u2013287 (2003)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"YT Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained common subsequence problem. Inf. Process. Lett. 88, 173\u2013176 (2003)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49390-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:54:41Z","timestamp":1720788881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49390-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493892","9783662493908"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49390-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}