Faster STR-IC-LCS Computation via RLE

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

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

2 引用 (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
出版者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 20177 6 2017

その他

その他28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017
ポーランド
Warsaw
期間7/4/177/6/17

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Kuboi, K., Fujishige, Y., Inenaga, S., Bannai, H., & Takeda, M. (2017). Faster STR-IC-LCS Computation via RLE. : 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 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 20.

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

Kuboi, K, Fujishige, Y, Inenaga, S, Bannai, H & Takeda, M 2017, Faster STR-IC-LCS Computation via RLE. : 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
Kuboi K, Fujishige Y, Inenaga S, Bannai H, Takeda M. Faster STR-IC-LCS Computation via RLE. : 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. 巻 78. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 20 https://doi.org/10.4230/LIPIcs.CPM.2017.20
Kuboi, Keita ; Fujishige, Yuta ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Faster STR-IC-LCS Computation via RLE. 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. 巻 78 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017.
@inproceedings{20ac42d558064e8398a9f7a9c1c94d1c,
title = "Faster STR-IC-LCS Computation via RLE",
abstract = "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.",
author = "Keita Kuboi and Yuta Fujishige and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2017",
month = "7",
day = "1",
doi = "10.4230/LIPIcs.CPM.2017.20",
language = "English",
volume = "78",
booktitle = "28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

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 -