Range Shortest Unique Substring Queries
Range Shortest Unique Substring Queries
复制标题
范围最短唯一子字符串查询
DOI:
10.1007/978-3-030-32686-9_18
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Thankachan, Sharma V.
中科院分区:
文献类型:
--
作者:
Abedin, Paniz;Ganguly, Arnab;Pissis, Solon P.;Thankachan, Sharma V.
Letbe a string of lengthnandbe the substring ofstarting at positioniand ending at positionj. A substringofis a repeat if it occurs more than once in; otherwise, it is a unique substring of. Repeats and unique substrings are of great interest in computational biology and in information retrieval. Given stringas input, theShortest Unique Substringproblem is to find a shortest substring ofthat does not occur elsewhere in. In this paper, we introduce the range variant of this problem, which we call theRange Shortest Unique Substringproblem. The task is to construct a data structure overanswering the following type of online queries efficiently. Given a range, return a shortest substringofwith exactly one occurrence in. We present an-word data structure withquery time, whereis the word size. Our construction is based on a non-trivial reduction allowing us to apply a recently introduced optimal geometric data structure [Chan et al. ICALP 2018].
登录
查看更多内容
DOI:
10.1007/978-3-319-94776
发表时间:
2018
期刊:
International Computing and Combinatorics Conference
影响因子:
--
作者:
Abedin, P.;Ganguly, A.;Hon, W. K.;Nekrich, Y.;Sadakane, K.;Shah, R.;Thankachan, S. V.
通讯作者:
Thankachan, S. V.
DOI:
--
发表时间:
2019
期刊:
影响因子:
--
作者:
Kiichi Watanabe
通讯作者:
Kiichi Watanabe
DOI:
--
发表时间:
2016
期刊:
International Symposium on Algorithms and Computation
影响因子:
--
作者:
Arnab Ganguly;W. Hon;Rahul Shah;Sharma V. Thankachan
通讯作者:
Sharma V. Thankachan
DOI:
--
发表时间:
2018
期刊:
Bioinform.
影响因子:
--
作者:
Lorraine A. K. Ayad;S. Pissis;D. Polychronopoulos
通讯作者:
D. Polychronopoulos
DOI:
--
发表时间:
2015
期刊:
SPIRE
影响因子:
--
作者:
A. Amir;Moshe Lewenstein;Sharma V. Thankachan
通讯作者:
Sharma V. Thankachan