The performance of linear time suffix sorting algorithms

被引:0
|
作者
Puglisi, SJ [1 ]
Smyth, WF [1 ]
Turpin, A [1 ]
机构
[1] Curtin Univ Technol, Dept Comp, Perth, WA 6001, Australia
关键词
ARRAY CONSTRUCTION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:358 / 367
页数:10
相关论文
共 50 条
  • [31] Induced Suffix Sorting for String Collections
    Louza, Felipe A.
    Gog, Simon
    Telles, Guilherme P.
    2016 DATA COMPRESSION CONFERENCE (DCC), 2016, : 43 - 52
  • [32] Scalable Suffix Sorting on a Multicore Machine
    Xie, Jing Yi
    Nong, Ge
    Lao, Bin
    Xu, Wentao
    IEEE TRANSACTIONS ON COMPUTERS, 2020, 69 (09) : 1364 - 1375
  • [33] Space efficient linear time construction of suffix arrays
    Ko, Pang
    Aluru, Srinivas
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 143 - 156
  • [34] Optimal In-Place Suffix Sorting
    Li, Zhize
    Li, Jian
    Huo, Hongwei
    2018 DATA COMPRESSION CONFERENCE (DCC 2018), 2018, : 422 - 422
  • [35] Space/time-efficient RDF stores based on circular suffix sorting
    Nieves R. Brisaboa
    Ana Cerdeira-Pena
    Guillermo de Bernardo
    Antonio Fariña
    Gonzalo Navarro
    The Journal of Supercomputing, 2023, 79 : 5643 - 5683
  • [36] A fast suffix-sorting algorithm
    Ahlswede, R.
    Balkenhol, B.
    Deppe, C.
    Frohlich, M.
    GENERAL THEORY OF INFORMATION TRANSFER AND COMBINATORICS, 2006, 4123 : 719 - 734
  • [37] Space/time-efficient RDF stores based on circular suffix sorting
    Brisaboa, Nieves R.
    Cerdeira-Pena, Ana
    de Bernardo, Guillermo
    Farina, Antonio
    Navarro, Gonzalo
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (05): : 5643 - 5683
  • [38] Suffix sorting via matching statistics
    Zsuzsanna Lipták
    Francesco Masillo
    Simon J. Puglisi
    Algorithms for Molecular Biology, 19
  • [39] Optimal in-place suffix sorting
    Li, Zhize
    Li, Jian
    Huo, Hongwei
    INFORMATION AND COMPUTATION, 2022, 285
  • [40] In-Place Sparse Suffix Sorting
    Prezza, Nicola
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1496 - 1508