Constructing suffix trees on-line in linear time

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Proceedings of the IFIP World Computer Congress | 1992年 / 1卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] On suffix extensions in suffix trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    THEORETICAL COMPUTER SCIENCE, 2012, 457 : 27 - 34
  • [32] On Suffix Extensions in Suffix Trees
    Breslauer, Dany
    Italiano, Giuseppe F.
    STRING PROCESSING AND INFORMATION RETRIEVAL, 2011, 7024 : 301 - +
  • [33] On-line construction of compact suffix vectors and maximal repeats
    Prieur, Elise
    Lecroq, Thierry
    THEORETICAL COMPUTER SCIENCE, 2008, 407 (1-3) : 290 - 301
  • [34] 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
  • [35] ON-LINE VERTEX RANKING OF TREES
    McDonald, Daniel C.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (01) : 145 - 156
  • [36] From suffix trees to suffix vectors
    Prieur, Elise
    Lecroq, Thierry
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (06) : 1385 - 1402
  • [37] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    THEORETICAL COMPUTER SCIENCE, 1999, 220 (02) : 469 - 488
  • [38] On-line matching routing on trees
    Roberts, A
    Symvonis, A
    LATIN '98: THEORETICAL INFORMATICS, 1998, 1380 : 282 - 291
  • [39] A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
    Wing-Kai Hon
    Tak-Wah Lam
    Kunihiko Sadakane
    Wing-Kin Sung
    Siu-Ming Yiu
    Algorithmica, 2007, 48 : 23 - 36
  • [40] A space and time efficient algorithm for constructing compressed suffix arrays
    Hon, Wing-Kai
    Lam, Tak-Wah
    Sadakane, Kunihiko
    Sung, Wing-Kin
    Yiu, Siu-Ming
    ALGORITHMICA, 2007, 48 (01) : 23 - 36
12345