@inproceedings{dd6798dc69224dff9282bbcc8a0b17b7,

title = "Longest common subsequence in at least k length order-isomorphic substrings",

abstract = "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.",

keywords = "Dynamic programming, Longest common subsequence, Order-isomorphism, Order-preserving matching",

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",

note = "Funding Information: 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.; 43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 ; Conference date: 16-01-2017 Through 20-01-2017",

year = "2017",

doi = "10.1007/978-3-319-51963-0_28",

language = "English",

isbn = "9783319519623",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "363--374",

editor = "Christel Baier and {van den Brand}, Mark and Johann Eder and Mike Hinchey and Tiziana Margaria and Bernhard Steffen",

booktitle = "SOFSEM 2017",

}