Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings
Data Structures and Algorithms
2017-02-07 v3
Abstract
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least length substrings. First, we show an time algorithm for the problem which gives a better worst-case running time than existing algorithms, where and are lengths of the input strings. Furthermore, we mainly consider the LCS in at least length order-isomorphic substrings problem. We show that the problem can also be solved in worst-case time by an easy-to-implement algorithm.
Cite
@article{arxiv.1609.03668,
title = {Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings},
author = {Yohei Ueki and Diptarama and Masatoshi Kurihara and Yoshiaki Matsuoka and Kazuyuki Narisawa and Ryo Yoshinaka and Hideo Bannai and Shunsuke Inenaga and Ayumi Shinohara},
journal= {arXiv preprint arXiv:1609.03668},
year = {2017}
}
Comments
14 pages, 7 figures, contains erratum to Springer's version (SOFSEM 2017)