Constructing suffix trees on-line in linear time

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Proceedings of the IFIP World Computer Congress | 1992年 / 1卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Computing suffix links for suffix trees and arrays
    Maass, Moritz G.
    INFORMATION PROCESSING LETTERS, 2007, 101 (06) : 250 - 254
  • [42] On-line parameter identification of linear time-delay systems
    Orlov, Y
    Belkoura, L
    Richard, JP
    Dambrine, M
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 630 - 635
  • [43] Converting suffix trees into factor/suffix oracles
    Rusu, Irena
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 324 - 340
  • [44] Distributed suffix trees
    Clifford, Raphael
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 176 - 197
  • [45] Suffix Trees on Words
    A. Andersson
    N. J. Larsson
    K. Swanson
    Algorithmica, 1999, 23 : 246 - 260
  • [46] Fast on-line kernel learning for trees
    Aiolli, Fabio
    Da San Martino, Giovanni
    Sperduti, Alessandro
    Moschitti, Alessandro
    ICDM 2006: SIXTH INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2006, : 787 - 791
  • [47] The performance of linear time suffix sorting algorithms
    Puglisi, SJ
    Smyth, WF
    Turpin, A
    DCC 2005: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2005, : 358 - 367
  • [48] On-line arbitrarily vertex decomposable trees
    Hornak, Mirko
    Tuza, Zsolt
    Wozniak, Mariusz
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (11) : 1420 - 1429
  • [49] Optimal on-line decremental connectivity in trees
    Alstrup, S
    Secher, JP
    Spork, M
    INFORMATION PROCESSING LETTERS, 1997, 64 (04) : 161 - 164
  • [50] Suffix trees on words
    Andersson, A
    Larsson, NJ
    Swanson, K
    ALGORITHMICA, 1999, 23 (03) : 246 - 260
12345