### 抄録

palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs.

元の言語 | 英語 |
---|---|

ホスト出版物のタイトル | Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers |

編集者 | William F. Smyth, Ljiljana Brankovic, Joe Ryan |

出版者 | Springer Verlag |

ページ | 397-408 |

ページ数 | 12 |

ISBN（印刷物） | 9783319788241 |

DOI | |

出版物ステータス | 出版済み - 1 1 2018 |

イベント | 28th International Workshop on Combinational Algorithms, IWOCA 2017 - Newcastle, NSW, オーストラリア 継続期間: 7 17 2017 → 7 21 2017 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 10765 LNCS |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### その他

その他 | 28th International Workshop on Combinational Algorithms, IWOCA 2017 |
---|---|

国 | オーストラリア |

市 | Newcastle, NSW |

期間 | 7/17/17 → 7/21/17 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### これを引用

*Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers*(pp. 397-408). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10765 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-78825-8_32

**Shortest unique palindromic substring queries in optimal time.** / Nakashima, Yuto; Inoue, Hiroe; Mieno, Takuya; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

研究成果: 著書/レポートタイプへの貢献 › 会議での発言

*Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10765 LNCS, Springer Verlag, pp. 397-408, 28th International Workshop on Combinational Algorithms, IWOCA 2017, Newcastle, NSW, オーストラリア, 7/17/17. https://doi.org/10.1007/978-3-319-78825-8_32

}

TY - GEN

T1 - Shortest unique palindromic substring queries in optimal time

AU - Nakashima, Yuto

AU - Inoue, Hiroe

AU - Mieno, Takuya

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs.

AB - palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs.

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

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

U2 - 10.1007/978-3-319-78825-8_32

DO - 10.1007/978-3-319-78825-8_32

M3 - Conference contribution

SN - 9783319788241

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

SP - 397

EP - 408

BT - Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers

A2 - Smyth, William F.

A2 - Brankovic, Ljiljana

A2 - Ryan, Joe

PB - Springer Verlag

ER -