{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:48:57Z","timestamp":1778827737616,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031637742","type":"print"},{"value":"9783031637759","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63775-9_5","type":"book-chapter","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T06:03:07Z","timestamp":1719468187000},"page":"58-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Search Algorithms for\u00a0the\u00a0Restricted Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1358-3789","authenticated-orcid":false,"given":"Marko","family":"Djukanovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9839-6039","authenticated-orcid":false,"given":"Aleksandar","family":"Kartelj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7330-1902","authenticated-orcid":false,"given":"Tome","family":"Eftimov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0305-9270","authenticated-orcid":false,"given":"Jaume","family":"Reixach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1736-3559","authenticated-orcid":false,"given":"Christian","family":"Blum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,28]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1016\/j.cor.2008.02.003","volume":"36","author":"H Akeb","year":"2009","unstructured":"Akeb, H., Hifi, M., M\u2019Hallah, R.: A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5), 1513\u20131528 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/s10878-012-9588-2","volume":"28","author":"HY Ann","year":"2014","unstructured":"Ann, H.Y., Yang, C.B., Tseng, C.T.: Efficient polynomial-time algorithms for the constrained lcs problem with strings exclusion. J. Comb. Optim. 28(4), 800\u2013813 (2014)","journal-title":"J. Comb. Optim."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A Apostolico","year":"1987","unstructured":"Apostolico, A., Guerra, C.: The longest common subsequence problem revisited. Algorithmica 2, 315\u2013336 (1987)","journal-title":"Algorithmica"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp. 39\u201348. IEEE (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Blum, C., Blesa, M.J.: A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 129\u2013136. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969305"},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","first-page":"3178","DOI":"10.1016\/j.cor.2009.02.005","volume":"36","author":"C Blum","year":"2009","unstructured":"Blum, C., Blesa, M.J., Lopez-Ibanez, M.: Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12), 3178\u20133186 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1089\/cmb.2006.13.686","volume":"13","author":"JM Carlson","year":"2006","unstructured":"Carlson, J.M., Chakravarty, A., Gross, R.H.: Beam: a beam search algorithm for the identification of cis-regulatory elements in groups of genes. J. Comput. Biol. 13(3), 686\u2013701 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"5_CR8","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":"5_CR9","doi-asserted-by":"publisher","unstructured":"Deorowicz, S., Grabowski, S.: Subcubic algorithms for the sequence excluded LCS problem. In: Gruca, A.., Czach\u00f3rski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol. 242, pp. 503\u2013510. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-02309-0_55","DOI":"10.1007\/978-3-319-02309-0_55"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Djukanovic, M., Berger, C., Raidl, G.R., Blum, C.: On solving a generalized constrained longest common subsequence problem. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds.) OPTIMA 2020. LNCS, vol. 12422, pp. 55\u201370. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62867-3_5","DOI":"10.1007\/978-3-030-62867-3_5"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Djukanovic, M., Raidl, G.R., Blum, C.: A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation. In: Nicosia, G., Pardalos, P., Umeton, R., Giuffrida, G., Sciacca, V. (eds.) LOD 2019. LNCS, vol. 11943, pp. 154\u2013167. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37599-7_14","DOI":"10.1007\/978-3-030-37599-7_14"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Djukanovic, M., Raidl, G.R., Blum, C.: Finding longest common subsequences: new anytime A$$^*$$ search results. Appl. Soft Comput. 95, 106499 (2020)","DOI":"10.1016\/j.asoc.2020.106499"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ins.2014.10.019","volume":"295","author":"E Farhana","year":"2015","unstructured":"Farhana, E., Rahman, M.S.: Constrained sequence analysis algorithms in computational biology. Inf. Sci. 295, 247\u2013257 (2015)","journal-title":"Inf. Sci."},{"key":"5_CR14","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_26","DOI":"10.1007\/978-3-642-16321-0_26"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybernet."},{"issue":"4","key":"5_CR16","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(4), 664\u2013675 (1977)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","volume":"65","author":"G Lin","year":"2002","unstructured":"Lin, G., Chen, Z.Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci. 65(3), 465\u2013480 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Maier, D.: The Complexity of Some Problems on Sequences. Princeton University (1978)","DOI":"10.1145\/322063.322075"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.engappai.2011.08.006","volume":"25","author":"SR Mousavi","year":"2012","unstructured":"Mousavi, S.R., Bahri, F., Tabataba, F.S.: An enhanced beam search algorithm for the shortest common supersequence problem. Eng. Appl. Artif. Intell. 25(3), 457\u2013467 (2012)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00319-1","volume":"118","author":"I Sabuncuoglu","year":"1999","unstructured":"Sabuncuoglu, I., Bayiz, M.: Job shop scheduling with beam search. Eur. J. Oper. Res. 118(2), 390\u2013412 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR21","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, Inc. (1987)"},{"issue":"4","key":"5_CR22","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 longest common subsequence problem. Inf. Process. Lett. 88(4), 173\u2013176 (2003)","journal-title":"Inf. Process. Lett."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Wang, Q., Pan, M., Shang, Y., Korkin, D.: A fast heuristic search algorithm for finding the longest common subsequence of multiple strings. Proc. AAAI Conf. Artif. Intell. 24, 1287\u20131292 (2010)","DOI":"10.1609\/aaai.v24i1.7493"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63775-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:09:26Z","timestamp":1732309766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63775-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637742","9783031637759"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63775-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}