Shortest unique palindromic substring queries in optimal time

DOI10.1007/978-3-319-78825-8_32zbMath1504.68297arXiv1608.05550OpenAlexW2524786565MaRDI QIDQ1642725

Hideo Bannai, Takuya Mieno, Hiroe Inoue, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda

Publication date: 15 June 2018

Full work available at URL: https://arxiv.org/abs/1608.05550

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Related Items

Shortest unique palindromic substring queries in semi-dynamic settings