抄録
A square is a non-empty string of form Y Y. The longest common square subsequence (LCSqS) problem is to compute a longest square occurring as a subsequence in two given strings A and B. We show that the problem can easily be solved in O(n6) time or O(|M|n4) time with O(n4) space, where n is the length of the strings and M is the set of matching points between A and B. Then, we show that the problem can also be solved in O(σ|M|3 + n) time and O(|M|2 + n) space, or in O(|M|3 log2 n log log n + n) time with O(|M|3 + n) space, where σ is the number of distinct characters occurring in A and B. We also study lower bounds for the LCSqS problem for two or more strings.
| 元の言語 | 英語 |
|---|---|
| ホスト出版物のタイトル | 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 |
| 編集者 | Binhai Zhu, Gonzalo Navarro, David Sankoff |
| 出版者 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ページ | 151-1513 |
| ページ数 | 1363 |
| ISBN（電子版） | 9783959770743 |
| DOI | |
| 出版物ステータス | 出版済み - 5 1 2018 |
| イベント | 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 - Qingdao, 中国 継続期間: 7 2 2018 → 7 4 2018 |
出版物シリーズ
| 名前 | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| 巻 | 105 |
| ISSN（印刷物） | 1868-8969 |
その他
| その他 | 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 |
|---|---|
| 国 | 中国 |
| 市 | Qingdao |
| 期間 | 7/2/18 → 7/4/18 |
All Science Journal Classification (ASJC) codes
- Software
これを引用
Computing longest common square subsequences. / Inoue, Takafumi; Inenaga, Shunsuke; Hyyrö, Heikki; Bannai, Hideo; Takeda, Masayuki.
29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. 版 / Binhai Zhu; Gonzalo Navarro; David Sankoff. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. p. 151-1513 (Leibniz International Proceedings in Informatics, LIPIcs; 巻 105).研究成果: 著書/レポートタイプへの貢献 › 会議での発言
}
TY - GEN
T1 - Computing longest common square subsequences
AU - Inoue, Takafumi
AU - Inenaga, Shunsuke
AU - Hyyrö, Heikki
AU - Bannai, Hideo
AU - Takeda, Masayuki
PY - 2018/5/1
Y1 - 2018/5/1
N2 - A square is a non-empty string of form Y Y. The longest common square subsequence (LCSqS) problem is to compute a longest square occurring as a subsequence in two given strings A and B. We show that the problem can easily be solved in O(n6) time or O(|M|n4) time with O(n4) space, where n is the length of the strings and M is the set of matching points between A and B. Then, we show that the problem can also be solved in O(σ|M|3 + n) time and O(|M|2 + n) space, or in O(|M|3 log2 n log log n + n) time with O(|M|3 + n) space, where σ is the number of distinct characters occurring in A and B. We also study lower bounds for the LCSqS problem for two or more strings.
AB - A square is a non-empty string of form Y Y. The longest common square subsequence (LCSqS) problem is to compute a longest square occurring as a subsequence in two given strings A and B. We show that the problem can easily be solved in O(n6) time or O(|M|n4) time with O(n4) space, where n is the length of the strings and M is the set of matching points between A and B. Then, we show that the problem can also be solved in O(σ|M|3 + n) time and O(|M|2 + n) space, or in O(|M|3 log2 n log log n + n) time with O(|M|3 + n) space, where σ is the number of distinct characters occurring in A and B. We also study lower bounds for the LCSqS problem for two or more strings.
UR - http://www.scopus.com/inward/record.url?scp=85048306163&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85048306163&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.CPM.2018.15
DO - 10.4230/LIPIcs.CPM.2018.15
M3 - Conference contribution
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 151
EP - 1513
BT - 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
A2 - Zhu, Binhai
A2 - Navarro, Gonzalo
A2 - Sankoff, David
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ER -