Shortest Unique Substrings Queries in Optimal Time

被引：0

作者：

Tsuruta, Kazuya ^{[1
]}

Inenaga, Shunsuke ^{[1
]}

Bannai, Hideo ^{[1
]}

Takeda, Masayuki ^{[1
]}

机构：

[1] Kyushu Univ, Dept Informat, Fukuoka 812, Japan

来源：

SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE | 2014年 / 8327卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present an optimal, linear time algorithm for the shortest unique substring problem, thus improving the algorithm by Pei et al. (ICDE 2013). Our implementation is simple and based on suffix arrays. Computational experiments show that our algorithm is much more efficient in practice, compared to that of Pei et al.

引用

页码：503 / 513

页数：11

共 50 条

[21] Minimum Unique Substrings and Maximum Repeats
Ilie, Lucian
Smyth, William F.
FUNDAMENTA INFORMATICAE, 2011, 110 (1-4) : 183 - 195
[22] An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon
Schuierer, S
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 205 - 225
[23] Computing Minimal Unique Substrings for a Sliding Window
Mieno, Takuya
Fujishige, Yuta
Nakashima, Yuto
Inenaga, Shunsuke
Bannai, Hideo
Takeda, Masayuki
ALGORITHMICA, 2022, 84 (03) : 670 - 693
[24] Computing Minimal Unique Substrings for a Sliding Window
Takuya Mieno
Yuta Fujishige
Yuto Nakashima
Shunsuke Inenaga
Hideo Bannai
Masayuki Takeda
Algorithmica, 2022, 84 : 670 - 693
[25] In Transit to Constant Time Shortest-Path Queries in Road Networks
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik
PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 46 - +
[26] Internal shortest absent word queries in constant time and linear space
Badkobeh, Golnaz
Charalampopoulos, Panagiotis
Kosolobov, Dmitry
Pissis, Solon P.
THEORETICAL COMPUTER SCIENCE, 2022, 922 : 271 - 282
[27] THE SHORTEST TIME AND OPTIMAL INVESTMENT CONTROL IN DUOPOLY
Wang, Fengjun
Zhang, Qingling
Li, Bin
Liu, Wanquan
PACIFIC JOURNAL OF OPTIMIZATION, 2017, 13 (03): : 385 - 402
[28] OPTIMAL CANONIZATION OF ALL SUBSTRINGS OF A STRING
APOSTOLICO, A
CROCHEMORE, M
INFORMATION AND COMPUTATION, 1991, 95 (01) : 76 - 95
[29] Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries
Salzman, Oren
Halperin, Dan
2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 4161 - 4166
[30] Robust, Almost Constant Time Shortest-Path Queries in Road Networks
Sanders, Peter
Schultes, Dominik
SHORTEST PATH PROBLEM, 2009, 74 : 193 - 218

← 1 2 3 4 5 →