EFFICIENT IMPLEMENTATION OF SUFFIX TREES

被引：39
|
作者：
ANDERSSON, A
NILSSON, S
机构：
[1] Department of Computer Science, Lund University, Lund, S-221 00
来源：
SOFTWARE-PRACTICE & EXPERIENCE | 1995年 / 25卷 / 02期
关键词：
LC-TRIE; PATH COMPRESSION; LEVEL COMPRESSION; DATA COMPRESSION; SUFFIX TREE; SUFFIX ARRAY;
D O I：
10.1002/spe.4380250203
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the problem of string searching using the traditional approach of storing all unique substrings of the text in a suffix tree. The methods of path compression, level compression and data compression are combined to build a simple, compact and efficient implementation of a suffix tree. Based on a comparative discussion and extensive experiments, we argue that our new data structure is superior to previous methods in many practical situations.
引用
收藏
页码：129 / 141
页数：13
相关论文
共 50 条
  • [41] Online suffix trees with counts
    O Nuallain, B
    de Rooij, S
    [J]. DCC 2004: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2004, : 555 - 555
  • [42] Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
    Vitale, Luciana
    Martin, Alvaro
    Seroussi, Gadiel
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 595 : 34 - 45
  • [43] Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
    Vitale, Luciana
    Martin, Alvaro
    Seroussi, Gadiel
    [J]. 2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1924 - 1928
  • [44] BuST-bundled Suffix Trees
    Bortolussi, Luca
    Fabris, Francesco
    Policriti, Alberto
    [J]. FOURTH IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE - TCS 2006, 2006, 209 : 91 - +
  • [45] AVERAGE SIZES OF SUFFIX TREES AND DAWGS
    BLUMER, A
    EHRENFEUCHT, A
    HAUSSLER, D
    [J]. DISCRETE APPLIED MATHEMATICS, 1989, 24 (1-3) : 37 - 45
  • [46] Compressed Suffix Trees with Full Functionality
    Kunihiko Sadakane
    [J]. Theory of Computing Systems, 2007, 41 : 589 - 607
  • [47] Compressed suffix trees with full functionality
    Sadakane, Kunihiko
    [J]. THEORY OF COMPUTING SYSTEMS, 2007, 41 (04) : 589 - 607
  • [48] PROBABILISTIC ANALYSIS OF GENERALIZED SUFFIX TREES
    SZPANKOWSKI, W
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 644 : 1 - 14
  • [49] Grammatical inference using suffix trees
    Geertzen, J
    van Zaanen, M
    [J]. GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 163 - 174
  • [50] Practical methods for constructing suffix trees
    Yuanyuan Tian
    Sandeep Tata
    Richard A. Hankins
    Jignesh M. Patel
    [J]. The VLDB Journal, 2005, 14 : 281 - 299
12345