Abstract
The longest common palindromic subsequence (LCPS) problem requires to find a longest palindromic string that appears as subsequence in each string from a given set of input strings. The algorithms that can be found in the related literature are specific for LCPS problems with only two input strings. In contrast, in this work we consider the general case with an arbitrary number of input strings, which is NP-hard. To solve this problem we propose a fast greedy heuristic, a beam search, and an exact A\(^*\) algorithm. Moreover, A\(^*\) is extended by a simple diving mechanism as well as a combination with beam search in order to find good quality solutions already early in the search process. The most important findings that result from the experimental evaluation include that (1) A\(^*\) is able to efficiently find proven optimal solutions for smaller problem instances, (2) the anytime behavior of A\(^*\) can be significantly improved by incorporating diving or beam search, and (3) beam search is best from a purely heuristic perspective.
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
Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings of SPIRE 2000–7th International Symposium on String Processing and Information Retrieval, pp. 39–48. IEEE press (2000). https://doi.org/10.1109/SPIRE.2000.878178
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.: Longest common subsequence problems. In: Metaheuristics for String Problems in Bioinformatics, Chap. 3, pp. 45–60. Wiley (2016)
Blum, C., Raidl, G.R.: Hybrid Metaheuristics: Powerful Tools for Optimization. Springer (2016)
Bonizzoni, P., Della Vedova, G., Mauri, G.: Experimenting an approximation algorithm for the LCS. Discret. Appl. Math. 110(1), 13–24 (2001)
Brisk, P., Kaplan, A., Sarrafzadeh, M.: Area-efficient instruction set synthesis for reconfigurable system-on-chip design, pp. 395–400. IEEE Press (2004)
Choi, C.Q.: DNA palindromes found in cancer. Genome Biol. 6, 1–3 (2005). https://doi.org/10.1186/gb-spotlight-20050216-01
Chowdhury, S.R., Hasan, M.M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fund. Inf. 129(4), 329–340 (2014). https://doi.org/10.3233/FI-2014-974
Fraser, C.B.: Subsequences and Supersequences of Strings. Ph.D. thesis, University of Glasgow, Glasgow, UK (1995)
Giel-Pietraszuk, M., Hoffmann, M., Dolecka, S., Rychlewski, J., Barciszewski, J.: Palindromes in proteins. J. Protein Chem. 22(2), 109–113 (2003)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)
Hasan, M.M., Sohidull Islam, A.S.M., Sohel Rahman, M., Sen, A.: Palindromic subsequence automata and longest common palindromic subsequence. Math. Comput. Sci. 11, 219–232 (2017). http://link.springer.com/10.1007/s11786-016-0288-7
Huang, K., Yang, C., Tseng, K.: Fast algorithms for finding the common subsequences of multiple sequences. In: Proceedings of the IEEE International Computer Symposium, pp. 1006–1011. IEEE Press (2004)
Inenaga, S., Hyyrö, H.: A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129(supplement C), 11–15 (2018)
Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. J. Comput. Biol. 9(2), 371–388 (2002)
Larionov, S., Loskutov, A., Ryadchenko, E.: Chromosome evolution with naked eye: palindromic context of the life origin. Chaos: Interdiscip. J. Nonlinear Sci. 18(1) (2008)
Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322–336 (1978)
Masek, W.J., Paterson, M.S.: A faster computing string edit distances. Theor. Comput. Syst. Sci. 20, 18–31 (1980)
Mousavi, S.R., Tabataba, F.: An improved algorithm for the longest common subsequence problem. Comput. Oper. Res. 39(3), 512–520 (2012)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26, 297–307 (1988)
Storer, J.: Data Compression: Methods and Theory. Computer Science Press (1988)
Tanaka, H., Bergstrom, D.A., Yao, M.C., Tapscott, S.J.: Large DNA palindromes as a common form of structural chromosome aberrations in human cancers. Human Cell 19(1), 17–23 (2006)
Acknowledgments
We gratefully acknowledge the financial support of this 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
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Djukanovic, M., Raidl, G.R., Blum, C. (2019). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham. https://doi.org/10.1007/978-3-030-05348-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-05348-2_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05347-5
Online ISBN: 978-3-030-05348-2
eBook Packages: Computer ScienceComputer Science (R0)