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 条
  • [1] Analysis of linear time sorting algorithms
    Shutler, Paul M. E.
    Sim, Seok Woon
    Lim, Wei Yin Selina
    COMPUTER JOURNAL, 2008, 51 (04): : 451 - 469
  • [2] A linear time lower bound on updating algorithms for suffix trees
    Ayala-Rincon, M
    Conejo, PD
    STRING PROCESSING AND INFORMATION RETRIEVAL - PROCEEDINGS: A SOUTH AMERICAN SYMPOSIUM, 1998, : 1 - 6
  • [3] Two Efficient Algorithms for Linear Time Suffix Array Construction
    Nong, Ge
    Zhang, Sen
    Chan, Wai Hong
    IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (10) : 1471 - 1484
  • [4] Linear time online algorithms for constructing linear-size suffix trie
    Hendrian, Diptarama
    Takagi, Takuya
    Inenaga, Shunsuke
    Goto, Keisuke
    Funakoshi, Mitsuru
    THEORETICAL COMPUTER SCIENCE, 2024, 1015
  • [5] Real-Time Performance of Sorting Algorithms
    Peter P. Puschner
    Real-Time Systems, 1999, 16 : 63 - 79
  • [6] Real-time performance of sorting algorithms
    Technische Universitat Wien, Wien, Austria
    Real Time Syst, 1 (63-79):
  • [7] Real-time performance of sorting algorithms
    Puschner, PP
    REAL-TIME SYSTEMS, 1999, 16 (01) : 63 - 79
  • [8] Practical Linear-Time O(1)-Workspace Suffix Sorting for Constant Alphabets
    Nong, Ge
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2013, 31 (03) : 1 - 15
  • [9] A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
    Mauricio Ayala-Rincón
    Paulo D. Conejo
    Algorithmica , 2003, 37 : 233 - 241
  • [10] A linear time lower bound on McCreight and general updating algorithms for suffix trees
    Ayala-Rincón, M
    Conejo, PD
    ALGORITHMICA, 2003, 37 (03) : 233 - 241
12345