SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM

被引:816
|
作者
MCCREIGHT, EM [1 ]
机构
[1] XEROX CORP PALO ALTO RES CTR,PALO ALTO,CA 94304
关键词
D O I
10.1145/321941.321946
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:262 / 272
页数:11
相关论文
共 50 条
  • [21] A Suffix Tree Or Not a Suffix Tree?
    Starikovskaya, Tatiana
    Vildhoj, Hjalte Wedel
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 338 - 350
  • [22] A suffix tree or not a suffix tree?
    Starikovskaya, Tatiana
    Vildhoj, Hjalte Wedel
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 32 : 14 - 23
  • [23] Online Suffix Tree Construction for Streaming Sequences
    Ozcan, Giyasettin
    Alpkocak, Adil
    ADVANCES IN COMPUTER SCIENCE AND ENGINEERING, 2008, 6 : 69 - 81
  • [24] Three space-economical algorithms for calculating minimum-redundancy prefix codes
    Milidiú, RL
    Pessoa, AA
    Laber, ES
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (06) : 2185 - 2198
  • [25] Overcoming the memory bottleneck in suffix tree construction
    Farach, M
    Ferragina, P
    Muthukrishnan, S
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 174 - 183
  • [26] Efficient Representation for Online Suffix Tree Construction
    Larsson, N. Jesper
    Fuglsang, Kasper
    Karlsson, Kenneth
    EXPERIMENTAL ALGORITHMS, SEA 2014, 2014, 8504 : 400 - 411
  • [27] On the sorting-complexity of suffix tree construction
    Farach-Colton, M
    Ferragina, P
    Muthukrishnan, S
    JOURNAL OF THE ACM, 2000, 47 (06) : 987 - 1011
  • [28] An elegant algorithm for the construction of suffix arrays
    Rajasekaran, Sanguthevar
    Nicolae, Marius
    JOURNAL OF DISCRETE ALGORITHMS, 2014, 27 (27) : 21 - 28
  • [29] Optimal suffix tree construction with large alphabets
    Farach, M
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 137 - 143
  • [30] Two space-economical algorithms for calculating minimum redundancy prefix codes (extended abstract)
    Milidiú, RL
    Pessoa, AA
    Laber, ES
    DCC '99 - DATA COMPRESSION CONFERENCE, PROCEEDINGS, 1999, : 267 - 276