Constructing suffix trees on-line in linear time

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Proceedings of the IFIP World Computer Congress | 1992年 / 1卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] CONSTRUCTING SUFFIX TREES ON LINE IN LINEAR TIME
    UKKONEN, E
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1992, 12 : 484 - 492
  • [2] On-line linear time construction of sequential binary suffix trees
    Lai Huoyao & Liu Gongshen School of Information Security Engineering
    JournalofSystemsEngineeringandElectronics, 2009, 20 (05) : 1104 - 1110
  • [3] On-line linear time construction of sequential binary suffix trees
    Lai Huoyao
    Liu Gongshen
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2009, 20 (05) : 1104 - 1110
  • [4] On-line linear-time construction of word suffix trees
    Inenaga, Shunsuke
    Takeda, Masayuki
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 60 - 71
  • [5] On-line construction of suffix trees
    Ukkonen, E.
    Algorithmica (New York), 1995, 14 (03):
  • [6] On-Line Construction of Parameterized Suffix Trees
    Lee, Taehyung
    Na, Joong Chae
    Park, Kunsoo
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2009, 5721 : 31 - +
  • [7] Constructing suffix arrays in linear time
    Kim, Dong Kyue
    Sim, Jeong Seop
    Park, Heejin
    Park, Kunsoo
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 126 - 142
  • [8] Most Recent Match Queries in On-Line Suffix Trees
    Larsson, N. Jesper
    COMBINATORIAL PATTERN MATCHING, CPM 2014, 2014, 8486 : 252 - 261
  • [9] On-line construction of parameterized suffix trees for large alphabets
    Lee, Taehyung
    Na, Joong Chae
    Park, Kunsoo
    INFORMATION PROCESSING LETTERS, 2011, 111 (05) : 201 - 207
  • [10] On-line construction of two-dimensional suffix trees
    Giancarlo, R
    Guaiana, D
    JOURNAL OF COMPLEXITY, 1999, 15 (01) : 72 - 127
12345