Efficient suffix trees on secondary storage

被引:0
|
作者
Clark, DR [1 ]
Munro, JI [1 ]
机构
[1] UNIV WATERLOO,DEPT COMP SCI,WATERLOO,ON N2L 3G1,CANADA
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:383 / 391
页数:9
相关论文
共 50 条
  • [1] Obtaining provably good performance from suffix trees in secondary storage
    Ko, Pang
    Aluru, Srinivas
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 72 - 83
  • [2] Space efficient suffix trees
    Munro, I
    Raman, V
    Rao, SS
    [J]. FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 186 - 196
  • [3] Space efficient suffix trees
    Munro, JL
    Raman, V
    Rao, SS
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 39 (02): : 205 - 222
  • [4] EFFICIENT IMPLEMENTATION OF SUFFIX TREES
    ANDERSSON, A
    NILSSON, S
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 1995, 25 (02): : 129 - 141
  • [5] The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees and Suffix Arrays
    Lin, Jie
    Jiang, Yue
    Adjeroh, Don
    [J]. PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008, 2008, : 68 - 83
  • [6] Efficient implementation of lazy suffix trees
    Giegerich, R
    Kurtz, S
    Stoye, J
    [J]. ALGORITHM ENGINEERING, 1999, 1668 : 30 - 42
  • [7] Efficient implementation of lazy suffix trees
    Giegerich, R
    Kurtz, S
    Stoye, J
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2003, 33 (11): : 1035 - 1049
  • [8] Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays
    Dong Kyue Kim
    Minhwan Kim
    Heejin Park
    [J]. Algorithmica, 2008, 52 : 350 - 377
  • [9] Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays
    Kim, Dong Kyue
    Kim, Minhwan
    Park, Heejin
    [J]. ALGORITHMICA, 2008, 52 (03) : 350 - 377
  • [10] On suffix extensions in suffix trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 457 : 27 - 34