Faster STR-IC-LCS Computation via RLE

Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

4 被引用数 (Scopus)


The constrained LCS problem asks one to find a longest common subsequence of two input strings A and B with some constraints. The STR-IC-LCS problem is a variant of the constrained LCS problem, where the solution must include a given constraint string C as a substring. Given two strings A and B of respective lengths M and N, and a constraint string C of length at most min{M, N}, the best known algorithm for the STR-IC-LCS problem, proposed by Deorowicz (Inf. Process. Lett., 11:423-426, 2012), runs in O(MN) time. In this work, we present an O(mN+nM)-time solution to the STR-IC-LCS problem, where m and n denote the sizes of the run-length encodings of A and B, respectively. Since m ≤ M and n ≤ N always hold, our algorithm is always as fast as Deorowicz's algorithm, and is faster when input strings are compressible via RLE.

ホスト出版物のタイトル28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
編集者Jakub Radoszewski, Juha Karkkainen, Jakub Radoszewski, Wojciech Rytter
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
出版ステータス出版済み - 7 1 2017
イベント28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 - Warsaw, ポーランド
継続期間: 7 4 20177 6 2017


名前Leibniz International Proceedings in Informatics, LIPIcs


その他28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017

All Science Journal Classification (ASJC) codes

  • Software