Abstract
The longest common square subsequence (LCSqS) problem, a variant of the longest common subsequence (LCS) problem, aims at finding a subsequence common to all input strings that is, at the same time, a square subsequence. So far the LCSqS was solved only for two input strings. We present a heuristic approach, based on randomized local search and a hybrid of variable neighborhood search and beam search, to solve the LCSqS for an arbitrary set of input strings. The beam search makes use of a novel heuristic estimation of the approximated expected length of a LCS to guide the search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blum, C., Blesa, M.J., López-Ibáñez, M.: Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12), 3178–3186 (2009)
Blum, C., Festa, P.: Metaheuristics for String Problems in Bio-Informatics. Wiley, Hoboken (2016)
Djukanovic, M., Raidl, G., Blum, C.: Anytime algorithms for the longest common palindromic subsequence problem. Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien (2018)
Huang, K., Yang, C.-B., Tseng, K.-T., et al.: Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of the International Computer Symposium, pp. 1006–1011. IEEE Press (2004)
Inoue, T., Inenaga, S., Hyyrö, H., Bannai, H., Takeda, M.: Computing longest common square subsequences. In: Proceedings of CPM 2018–29th Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing (2018)
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Stützle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)
Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM (JACM) 25(2), 322–336 (1978)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Mousavi, S.R., Tabataba, F.: An improved algorithm for the longest common subsequence problem. Comput. Oper. Res. 39(3), 512–520 (2012)
Wang, Q., Pan, M., Shang, Y., Korkin, D.: A fast heuristic search algorithm for finding the longest common subsequence of multiple strings. In: Proceedings of AAAI 2010–24th AAAI Conference on Artificial Intelligence, pp. 1287–1292 (2010)
Acknowledgments
We gratefully acknowledge the financial support of the project by the Doctoral Program “Vienna Graduate School on Computational Optimization” funded by the Austrian Science Foundation (FWF) under contract no. W1260-N35.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Djukanovic, M., Raidl, G.R., Blum, C. (2020). A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2019. EUROCAST 2019. Lecture Notes in Computer Science(), vol 12013. Springer, Cham. https://doi.org/10.1007/978-3-030-45093-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-030-45093-9_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45092-2
Online ISBN: 978-3-030-45093-9
eBook Packages: Computer ScienceComputer Science (R0)