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
关键词
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 条
  • [41] Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
    Mieno, Takuya
    Kuhara, Yuki
    Akagi, Tooru
    Fujishige, Yuta
    Nakashima, Yuto
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 148 - 160
  • [42] Levelwise Mesh Sparsification for Shortest Path Queries
    Miyamoto, Yuichiro
    Uno, Takeaki
    Kubo, Mikio
    ALGORITHMS AND COMPUTATION, PT I, 2010, 6506 : 121 - +
  • [43] Shortest Beer Path Queries in Outerplanar Graphs
    Bacic, Joyce
    Mehrabi, Saeed
    Smid, Michiel
    ALGORITHMICA, 2023, 85 (06) : 1679 - 1705
  • [44] Shortest path queries in digraphs of small treewidth
    Chaudhuri, S
    Zaroliagis, CD
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 244 - 255
  • [45] Shortest Path Queries in Mobile Broadcast Environments
    Su, Ta-Chih
    Hsieh, Yun-Tung
    Liu, Chuan-Ming
    2009 17TH INTERNATIONAL CONFERENCE ON GEOINFORMATICS, VOLS 1 AND 2, 2009, : 954 - 959
  • [46] Shortest-Path Queries in Static Networks
    Sommer, Christian
    ACM COMPUTING SURVEYS, 2014, 46 (04)
  • [47] Shortest Beer Path Queries in Outerplanar Graphs
    Joyce Bacic
    Saeed Mehrabi
    Michiel Smid
    Algorithmica, 2023, 85 : 1679 - 1705
  • [48] SHORTEST PATH TO A SEGMENT AND QUICKEST VISIBILITY QUERIES
    Arkin, Esther M.
    Efrat, Alon
    Knauer, Christian
    Mitchell, Joseph S. B.
    Polishchuk, Valentin
    Rote, Guenter
    Schlipf, Lena
    Talvitie, Topi
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2016, 7 (02) : 77 - 100
  • [49] Learning Hypertrees From Shortest Path Queries
    Fallat, Shaun M.
    Maliuk, Valerii
    Mojallal, Seyed Ahmad
    Zilles, Sandra
    INTERNATIONAL CONFERENCE ON ALGORITHMIC LEARNING THEORY, VOL 237, 2024, 237
  • [50] An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra
    Yevgeny Schreiber
    Discrete & Computational Geometry, 2010, 43 : 21 - 53