On-line construction of suffix trees

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Algorithmica (New York) | 1995年 / 14卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Space-efficient construction of compressed suffix trees
    Prezza, Nicola
    Rosone, Giovanna
    THEORETICAL COMPUTER SCIENCE, 2021, 852 : 138 - 156
  • [22] On suffix extensions in suffix trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    THEORETICAL COMPUTER SCIENCE, 2012, 457 : 27 - 34
  • [23] On Suffix Extensions in Suffix Trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 301 - +
  • [24] On the construction of classes of suffix trees for square matrices: Algorithms and applications
    Giancarlo, R
    Grossi, R
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 111 - 122
  • [25] On-line ranking algorithms for trees
    Lee, CW
    Juan, JST
    FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 46 - 51
  • [26] ON-LINE VERTEX RANKING OF TREES
    McDonald, Daniel C.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (01) : 145 - 156
  • [27] On the construction of classes of suffix trees for square matrices: Algorithms and applications
    Giancarlo, R
    Grossi, R
    INFORMATION AND COMPUTATION, 1996, 130 (02) : 151 - 182
  • [28] From suffix trees to suffix vectors
    Prieur, Elise
    Lecroq, Thierry
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1385 - 1402
  • [29] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    THEORETICAL COMPUTER SCIENCE, 1999, 220 (02) : 469 - 488
  • [30] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 282 - 291
12345