TY - GEN

T1 - Computing longest common square subsequences

AU - Inoue, Takafumi

AU - Inenaga, Shunsuke

AU - Hyyrö, Heikki

AU - Bannai, Hideo

AU - Takeda, Masayuki

N1 - Publisher Copyright:
© 2018 Yoshifumi Sakai; licensed under Creative Commons License CC-BY.

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

AN - SCOPUS:85048306163

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

T2 - 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018

Y2 - 2 July 2018 through 4 July 2018

ER -