Algorithms and combinatorial properties on shortest unique palindromic substrings
Algorithms and combinatorial properties on shortest unique palindromic substrings
复制标题
最短唯一回文子串的算法和组合属性
DOI:
10.1016/j.jda.2018.11.009
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Masayuki Takeda
中科院分区:
文献类型:
--
作者:
Hiroe Inoue;Yuto Nakashima;Takuya Mieno;Shunsuke Inenaga;Hideo Bannai;Masayuki Takeda
A 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. We also discuss the number of SUPSs in a string.
登录
查看更多内容
DOI:
--
发表时间:
2015
期刊:
European journal of combinatorics (Print)
影响因子:
--
作者:
Mikhail Rubinchik;A. Shur
通讯作者:
A. Shur
DOI:
10.4230/lipics.cpm.2017.23
发表时间:
2017
期刊:
--
影响因子:
--
作者:
K. Borozdin;D. Kosolobov;Mikhail Rubinchik;A. Shur
通讯作者:
A. Shur
DOI:
10.1016/j.tcs.2017.05.032
发表时间:
2017
期刊:
Theor. Comput. Sci.
影响因子:
--
作者:
W. Hon;Sharma V. Thankachan;Bojian Xu
通讯作者:
Bojian Xu
DOI:
10.1109/icde.2013.6544887
发表时间:
2013
期刊:
2013 IEEE 29th International Conference on Data Engineering (ICDE)
影响因子:
--
作者:
J. Pei;W. Wu;Mi
通讯作者:
Mi
DOI:
--
发表时间:
2014
期刊:
J. Discrete Algorithms
影响因子:
--
作者:
G. Fici;T. Gagie;Juha Kärkkäinen;Dominik Kempa
通讯作者:
Dominik Kempa