Abstract
For a string S, a palindromic substring S[i.j] is said to be a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if S[i.j] occurs exactly once in S, the interval [i, j] contains [s, t], and every palindromic substring containing [s, t] which is shorter than S[i.j] occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on run-length encoded strings. We show how to preprocess a given run-length encoded string RLES of size m in O(m) space and O(mlog σRLES + m√log m/log logm) time so that all SUPSs for any subsequent query interval can be answered in O(√log m/log logm+ α) time, where α is the number of outputs, and σRLES is the number of distinct runs of RLES.
| Original language | English |
|---|---|
| Title of host publication | Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings |
| Editors | Charles J. Colbourn, Roberto Grossi, Nadia Pisanti |
| Publisher | Springer Verlag |
| Pages | 430-441 |
| Number of pages | 12 |
| ISBN (Print) | 9783030250041 |
| DOIs | |
| Publication status | Published - Jan 1 2019 |
| Event | 30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, Italy Duration: Jul 23 2019 → Jul 25 2019 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 11638 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 30th International Workshop on Combinatorial Algorithms, IWOCA 2019 |
|---|---|
| Country | Italy |
| City | Pisa |
| Period | 7/23/19 → 7/25/19 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
Shortest unique palindromic substring queries on run-length encoded strings. / Watanabe, Kiichi; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings. ed. / Charles J. Colbourn; Roberto Grossi; Nadia Pisanti. Springer Verlag, 2019. p. 430-441 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11638 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Shortest unique palindromic substring queries on run-length encoded strings
AU - Watanabe, Kiichi
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
PY - 2019/1/1
Y1 - 2019/1/1
N2 - For a string S, a palindromic substring S[i.j] is said to be a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if S[i.j] occurs exactly once in S, the interval [i, j] contains [s, t], and every palindromic substring containing [s, t] which is shorter than S[i.j] occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on run-length encoded strings. We show how to preprocess a given run-length encoded string RLES of size m in O(m) space and O(mlog σRLES + m√log m/log logm) time so that all SUPSs for any subsequent query interval can be answered in O(√log m/log logm+ α) time, where α is the number of outputs, and σRLES is the number of distinct runs of RLES.
AB - For a string S, a palindromic substring S[i.j] is said to be a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if S[i.j] occurs exactly once in S, the interval [i, j] contains [s, t], and every palindromic substring containing [s, t] which is shorter than S[i.j] occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on run-length encoded strings. We show how to preprocess a given run-length encoded string RLES of size m in O(m) space and O(mlog σRLES + m√log m/log logm) time so that all SUPSs for any subsequent query interval can be answered in O(√log m/log logm+ α) time, where α is the number of outputs, and σRLES is the number of distinct runs of RLES.
UR - http://www.scopus.com/inward/record.url?scp=85069747956&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85069747956&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-25005-8_35
DO - 10.1007/978-3-030-25005-8_35
M3 - Conference contribution
AN - SCOPUS:85069747956
SN - 9783030250041
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 430
EP - 441
BT - Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
A2 - Colbourn, Charles J.
A2 - Grossi, Roberto
A2 - Pisanti, Nadia
PB - Springer Verlag
ER -