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 条
  • [1] Shortest Unique Palindromic Substring Queries in Optimal Time
    Nakashima, Yuto
    Inoue, Hiroe
    Mieno, Takuya
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 : 397 - 408
  • [2] Indexed Matching Statistics and Shortest Unique Substrings
    Belazzougui, Djamal
    Cunial, Fabio
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 179 - 190
  • [3] On Shortest Unique Substring Queries
    Pei, Jian
    Wu, Wush Chi-Hsuan
    Yeh, Mi-Yen
    2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2013, : 937 - 948
  • [4] Algorithms and combinatorial properties on shortest unique palindromic substrings
    Inoue, Hiroe
    Nakashima, Yuto
    Mieno, Takuya
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    JOURNAL OF DISCRETE ALGORITHMS, 2018, 52-53 : 122 - 132
  • [5] Space-time trade-offs for finding shortest unique substrings and maximal unique matches
    Ganguly, Arnab
    Hon, Wing-Kai
    Shah, Rahul
    Thankachan, Sharma V.
    THEORETICAL COMPUTER SCIENCE, 2017, 700 : 75 - 88
  • [6] Shortest Unique Queries on Strings
    Hu, Xiaocheng
    Pei, Jian
    Tao, Yufei
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2014, 2014, 8799 : 161 - 172
  • [7] Genome comparison without alignment using shortest unique substrings
    Bernhard Haubold
    Nora Pierstorff
    Friedrich Möller
    Thomas Wiehe
    BMC Bioinformatics, 6
  • [8] A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
    Ileri, Atalay Mert
    Kulekci, M. Oguzhan
    Xu, Bojian
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 621 - 633
  • [9] A Survey on Shortest Unique Substring Queries
    Abedin, Paniz
    Kulekci, M. Oguzhan
    Thankachan, Shama, V
    ALGORITHMS, 2020, 13 (09)
  • [10] Space-efficient algorithms for computing minimal/shortest unique substrings
    Mieno, Takuya
    Koppl, Dominik
    Nakashima, Yuto
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    THEORETICAL COMPUTER SCIENCE, 2020, 845 : 230 - 242