{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T16:07:10Z","timestamp":1748880430762,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319023083"},{"type":"electronic","value":"9783319023090"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-02309-0_55","type":"book-chapter","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T07:57:47Z","timestamp":1379577467000},"page":"503-510","source":"Crossref","is-referenced-by-count":1,"title":["Subcubic Algorithms for the Sequence Excluded LCS Problem"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Deorowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"55_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-006-9020-x","volume":"13","author":"S. Bereg","year":"2007","unstructured":"Bereg, S., Kubica, M., Wale\u0144, T., Zhu, B.: RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization\u00a013(2), 179\u2013188 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"55_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.tcs.2008.08.042","volume":"409","author":"P. Bille","year":"2008","unstructured":"Bille, P., Farach-Colton, M.: Fast and compact regular expression matching. Theoretical Computer Science\u00a0409(3), 486\u2013496 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"55_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-009-9262-5","volume":"21","author":"Y.C. Chen","year":"2011","unstructured":"Chen, Y.C., Chao, K.M.: On the generalized constrained longest common subsequence problems. Journal of Combinatorial Optimization\u00a021(3), 383\u2013392 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"55_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"},{"issue":"1","key":"55_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ipl.2006.04.018","volume":"100","author":"S. Deorowicz","year":"2006","unstructured":"Deorowicz, S.: Speeding up transposition-invariant string matching. Information Processing Letters\u00a0100(1), 14\u201320 (2006)","journal-title":"Information Processing Letters"},{"issue":"11","key":"55_CR6","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. Information Processing Letters\u00a0112(11), 423\u2013426 (2012)","journal-title":"Information Processing Letters"},{"key":"55_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.\u00a06393, pp. 250\u2013257. Springer, Heidelberg (2010)"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, 1st edn. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"5","key":"55_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2007.08.028","volume":"105","author":"K.S. Huang","year":"2008","unstructured":"Huang, K.S., Yang, C.B., Tseng, K.T., Ann, H.Y., Peng, Y.H.: Efficient algorithm for finding interleaving relationship between sequences. Information Processing Letters\u00a0105(5), 188\u2013193 (2008)","journal-title":"Information Processing Letters"},{"key":"55_CR10","unstructured":"Hyyr\u00f6, H.: Bit-parallel LCS-length computation revisited. In: Proceedings of the 15th Australian Workshop on Combinatorial Algorithms (AWOC 2004), pp. 16\u201327. University of Sydney, Australia (2004)"},{"key":"55_CR11","doi-asserted-by":"crossref","unstructured":"Parvinnia, E., Taheri, M., Ziarati, K.: An improved longest common subsequence algorithm for reducing memory complexity in global alignment of dna sequences. In: International Conference on BioMedical Engineering and Informatics (BMEI 2008), vol.\u00a01, pp. 57\u201361. IEEE Computer Society (2008)","DOI":"10.1109\/BMEI.2008.212"},{"issue":"4","key":"55_CR12","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"},{"issue":"19-21","key":"55_CR13","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ipl.2013.07.005","volume":"113","author":"L. Wang","year":"2013","unstructured":"Wang, L., Wang, X., Wu, Y., Zhu, D.: A dynamic programming solution to a generalized LCS problem. Information Processing Letters\u00a0113(19-21), 723\u2013728 (2013)","journal-title":"Information Processing Letters"}],"container-title":["Advances in Intelligent Systems and Computing","Man-Machine Interactions 3"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02309-0_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T01:43:03Z","timestamp":1676338983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-02309-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319023083","9783319023090"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02309-0_55","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}