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
来源：
DCC 2005: DATA COMPRESSION CONFERENCE, PROCEEDINGS | 2005年
关键词：
ARRAY CONSTRUCTION;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：358 / 367
页数：10
相关论文
共 50 条
  • [21] Toward Optimizing the Cache Performance of Suffix Trees for Sequence Analysis Algorithms Suffix Tree Cache Performance Optimization
    Lee, Chih
    Huang, Chun-Hsi
    ADVANCES IN COMPUTATIONAL BIOLOGY, 2010, 680 : 411 - 417
  • [22] SORTING IN LINEAR EXPECTED TIME
    NOGA, MT
    ALLISON, DCS
    BIT, 1985, 25 (03): : 451 - 465
  • [23] Space efficient linear time construction of suffix arrays
    Ko, P
    Aluru, S
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 200 - 210
  • [24] Constructing suffix trees on-line in linear time
    Ukkonen, E.
    Proceedings of the IFIP World Computer Congress, 1992, 1
  • [25] Linear-time suffix parsing for deterministic languages
    Nederhof, MJ
    Bertsch, E
    JOURNAL OF THE ACM, 1996, 43 (03) : 524 - 554
  • [26] Grammar Compression by Induced Suffix Sorting
    Nunes D.S.N.
    Louza F.A.
    Gog S.
    Ayala-Rincón M.
    Navarro G.
    ACM Journal of Experimental Algorithmics, 2022, 27 (02):
  • [27] Optimal In-Place Suffix Sorting
    Li, Zhize
    Li, Jian
    Huo, Hongwei
    STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2018, 2018, 11147 : 268 - 284
  • [28] Succinct suffix sorting in external memory
    Han, Ling Bo
    Wu, Yi
    Nong, Ge
    INFORMATION PROCESSING & MANAGEMENT, 2021, 58 (01)
  • [29] Suffix sorting via matching statistics
    Liptak, Zsuzsanna
    Masillo, Francesco
    Puglisi, Simon J.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2024, 19 (01)
  • [30] Sorting permutations by prefix and suffix rearrangements
    Lintzmayer, Carla Negri
    Fertin, Guillaume
    Dias, Zanoni
    JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2017, 15 (01)
12345