Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least k length substrings. First, we show an O(mn) time algorithm for the problem which gives a better worst-case running time than existing algorithms, where m and n are lengths of the input strings. Furthermore, we mainly consider the LCS in at least k length order-isomorphic substrings problem. We show that the problem can also be solved in O(mn) worst-case time by an easy-to-implement algorithm.
KeywordsLongest common subsequence Dynamic programming Order-isomorphism Order-preserving matching
This work was funded by ImPACT Program of Council for Science, Technology and Innovation (Cabinet Office, Government of Japan), Tohoku University Division for Interdisciplinary Advance Research and Education, and JSPS KAKENHI Grant Numbers JP24106010, JP16H02783, JP26280003.
- 12.Khan, R., Ahmad, M., Zakarya, M.: Longest common subsequence based algorithm for measuring similarity between time series: a new approach. World Appl. Sci. J. 24(9), 1192–1198 (2013)Google Scholar
- 15.Pavetić, F., Žužić, G., Šikić, M.: \(LCSk\)++: practical similarity metric for long strings (2014). CoRR 1407.2407
- 16.Sović, I., Šikić, M., Wilm, A., Fenlon, S.N., Chen, S., Nagarajan, N.: Fast and sensitive mapping of nanopore sequencing reads with GraphMap. Nat. Commun. 7, Article No. 11307 (2016). doi: 10.1038/ncomms11307