On Longest Common Property Preserved Substring Queries

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

Abstract

We revisit the problem of longest common property preserving substring queries introduced by Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set X of k strings of total length n that can be pre-processed so that, given a query string y and a positive integer (Formula presented), we can determine the longest substring of y that satisfies some specific property and is common to at least (Formula presented) strings in X. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic substring in an off-line setting. In this paper, we give efficient solutions in the on-line setting for finding the longest common square, periodic, palindromic, and Lyndon substrings. More precisely, we show that X can be pre-processed in O(n) time resulting in a data structure of O(n) size that answers queries in (Formula presented) time and O(1) working space, where (Formula presented) is the size of the alphabet, and the common substring must be a square, a periodic substring, a palindrome, or a Lyndon word.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings
EditorsNieves R. Brisaboa, Simon J. Puglisi
PublisherSpringer
Pages162-174
Number of pages13
ISBN (Print)9783030326852
DOIs
Publication statusPublished - Jan 1 2019
Event26th International Symposium on String Processing and Information Retrieval, SPIRE 2019 - Segovia, Spain
Duration: Oct 7 2019Oct 9 2019

Publication series

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

Conference

Conference26th International Symposium on String Processing and Information Retrieval, SPIRE 2019
CountrySpain
CitySegovia
Period10/7/1910/9/19

Fingerprint

Data structures
Query
Strings
Lyndon Words
Palindrome
Square free
Efficient Solution
Data Structures
Integer
Line

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kai, K., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M., & Kociumaka, T. (2019). On Longest Common Property Preserved Substring Queries. In N. R. Brisaboa, & S. J. Puglisi (Eds.), String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings (pp. 162-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11811 LNCS). Springer. https://doi.org/10.1007/978-3-030-32686-9_12

On Longest Common Property Preserved Substring Queries. / Kai, Kazuki; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki; Kociumaka, Tomasz.

String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. ed. / Nieves R. Brisaboa; Simon J. Puglisi. Springer, 2019. p. 162-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11811 LNCS).

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

Kai, K, Nakashima, Y, Inenaga, S, Bannai, H, Takeda, M & Kociumaka, T 2019, On Longest Common Property Preserved Substring Queries. in NR Brisaboa & SJ Puglisi (eds), String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11811 LNCS, Springer, pp. 162-174, 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019, Segovia, Spain, 10/7/19. https://doi.org/10.1007/978-3-030-32686-9_12
Kai K, Nakashima Y, Inenaga S, Bannai H, Takeda M, Kociumaka T. On Longest Common Property Preserved Substring Queries. In Brisaboa NR, Puglisi SJ, editors, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Springer. 2019. p. 162-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-32686-9_12
Kai, Kazuki ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki ; Kociumaka, Tomasz. / On Longest Common Property Preserved Substring Queries. String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. editor / Nieves R. Brisaboa ; Simon J. Puglisi. Springer, 2019. pp. 162-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{53e87fd86b774de4b919f3e9fe69f12a,
title = "On Longest Common Property Preserved Substring Queries",
abstract = "We revisit the problem of longest common property preserving substring queries introduced by Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set X of k strings of total length n that can be pre-processed so that, given a query string y and a positive integer (Formula presented), we can determine the longest substring of y that satisfies some specific property and is common to at least (Formula presented) strings in X. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic substring in an off-line setting. In this paper, we give efficient solutions in the on-line setting for finding the longest common square, periodic, palindromic, and Lyndon substrings. More precisely, we show that X can be pre-processed in O(n) time resulting in a data structure of O(n) size that answers queries in (Formula presented) time and O(1) working space, where (Formula presented) is the size of the alphabet, and the common substring must be a square, a periodic substring, a palindrome, or a Lyndon word.",
author = "Kazuki Kai and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Tomasz Kociumaka",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-32686-9_12",
language = "English",
isbn = "9783030326852",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "162--174",
editor = "Brisaboa, {Nieves R.} and Puglisi, {Simon J.}",
booktitle = "String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings",

}

TY - GEN

T1 - On Longest Common Property Preserved Substring Queries

AU - Kai, Kazuki

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

AU - Kociumaka, Tomasz

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We revisit the problem of longest common property preserving substring queries introduced by Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set X of k strings of total length n that can be pre-processed so that, given a query string y and a positive integer (Formula presented), we can determine the longest substring of y that satisfies some specific property and is common to at least (Formula presented) strings in X. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic substring in an off-line setting. In this paper, we give efficient solutions in the on-line setting for finding the longest common square, periodic, palindromic, and Lyndon substrings. More precisely, we show that X can be pre-processed in O(n) time resulting in a data structure of O(n) size that answers queries in (Formula presented) time and O(1) working space, where (Formula presented) is the size of the alphabet, and the common substring must be a square, a periodic substring, a palindrome, or a Lyndon word.

AB - We revisit the problem of longest common property preserving substring queries introduced by Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set X of k strings of total length n that can be pre-processed so that, given a query string y and a positive integer (Formula presented), we can determine the longest substring of y that satisfies some specific property and is common to at least (Formula presented) strings in X. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic substring in an off-line setting. In this paper, we give efficient solutions in the on-line setting for finding the longest common square, periodic, palindromic, and Lyndon substrings. More precisely, we show that X can be pre-processed in O(n) time resulting in a data structure of O(n) size that answers queries in (Formula presented) time and O(1) working space, where (Formula presented) is the size of the alphabet, and the common substring must be a square, a periodic substring, a palindrome, or a Lyndon word.

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

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

U2 - 10.1007/978-3-030-32686-9_12

DO - 10.1007/978-3-030-32686-9_12

M3 - Conference contribution

AN - SCOPUS:85075653873

SN - 9783030326852

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

SP - 162

EP - 174

BT - String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings

A2 - Brisaboa, Nieves R.

A2 - Puglisi, Simon J.

PB - Springer

ER -