TY - GEN

T1 - Longest Square Subsequence Problem Revisited

AU - Inoue, Takafumi

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

N1 - Funding Information:
Acknowledgments. This work was supported by JSPS KAKENHI Grant Numbers JP17H01697 (SI), JP20H04141 (HB), and JST PRESTO Grant Number JPMJPR1922 (SI).
Funding Information:
This work was supported by JSPS KAKENHI Grant Numbers JP17H01697 (SI), JP20H04141 (HB), and JST PRESTO Grant Number JPMJPR1922 (SI).
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

PY - 2020

Y1 - 2020

N2 - The longest square subsequence (LSS) problem consists of computing a longest subsequence of a given string S that is a square, i.e., a longest subsequence of form XX appearing in S. It is known that an LSS of a string S of length n can be computed using time [Kosowski 2004], or with (model-dependent) polylogarithmic speed-ups using time [Tiskin 2013]. We present the first algorithm for LSS whose running time depends on other parameters, i.e., we show that an LSS of S can be computed in time with O(M) space, where r is the length of an LSS of S and M is the number of matching points on S.

AB - The longest square subsequence (LSS) problem consists of computing a longest subsequence of a given string S that is a square, i.e., a longest subsequence of form XX appearing in S. It is known that an LSS of a string S of length n can be computed using time [Kosowski 2004], or with (model-dependent) polylogarithmic speed-ups using time [Tiskin 2013]. We present the first algorithm for LSS whose running time depends on other parameters, i.e., we show that an LSS of S can be computed in time with O(M) space, where r is the length of an LSS of S and M is the number of matching points on S.

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

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

U2 - 10.1007/978-3-030-59212-7_11

DO - 10.1007/978-3-030-59212-7_11

M3 - Conference contribution

AN - SCOPUS:85092089955

SN - 9783030592110

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 147

EP - 154

BT - String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings

A2 - Boucher, Christina

A2 - Thankachan, Sharma V.

PB - Springer Science and Business Media Deutschland GmbH

T2 - 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020

Y2 - 13 October 2020 through 15 October 2020

ER -