### 抄録

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 |

出版者 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |

巻 | 78 |

ISBN（電子版） | 9783959770392 |

DOI | |

出版物ステータス | 出版済み - 7 1 2017 |

イベント | 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017 - Warsaw, ポーランド 継続期間: 7 4 2017 → 7 6 2017 |

### その他

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

国 | ポーランド |

市 | Warsaw |

期間 | 7/4/17 → 7/6/17 |

### All Science Journal Classification (ASJC) codes

- Software

### これを引用

*28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017*(巻 78). [20] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2017.20

**Faster STR-IC-LCS Computation via RLE.** / Kuboi, Keita; Fujishige, Yuta; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

研究成果: 著書/レポートタイプへの貢献 › 会議での発言

*28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017.*巻. 78, 20, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, ポーランド, 7/4/17. https://doi.org/10.4230/LIPIcs.CPM.2017.20

}

TY - GEN

T1 - Faster STR-IC-LCS Computation via RLE

AU - Kuboi, Keita

AU - Fujishige, Yuta

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2017/7/1

Y1 - 2017/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027283006&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027283006&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2017.20

DO - 10.4230/LIPIcs.CPM.2017.20

M3 - Conference contribution

VL - 78

BT - 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -