Longest Square Subsequence Problem Revisited

Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings
EditorsChristina Boucher, Sharma V. Thankachan
PublisherSpringer Science and Business Media Deutschland GmbH
Pages147-154
Number of pages8
ISBN (Print)9783030592110
DOIs
Publication statusPublished - 2020
Event27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 - Orlando, United States
Duration: Oct 13 2020Oct 15 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12303 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on String Processing and Information Retrieval, SPIRE 2020
CountryUnited States
CityOrlando
Period10/13/2010/15/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Longest Square Subsequence Problem Revisited'. Together they form a unique fingerprint.

Cite this