On-line construction of suffix trees

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Algorithmica (New York) | 1995年 / 14卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Fast construction of generalized suffix trees over a very large alphabet
    Chen, ZX
    Fowler, R
    Fu, AWC
    Wang, CY
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 284 - 293
  • [32] A simple construction of two-dimensional suffix trees in linear time
    Kim, Dong Kyue
    Na, Joong Chae
    Sim, Jeong Seop
    Park, Kunsoo
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 352 - +
  • [33] Linear-Time Construction of Two-Dimensional Suffix Trees
    Kim, Dong Kyue
    Na, Joong Chae
    Sim, Jeong Seop
    Park, Kunsoo
    ALGORITHMICA, 2011, 59 (02) : 269 - 297
  • [34] Computing suffix links for suffix trees and arrays
    Maass, Moritz G.
    INFORMATION PROCESSING LETTERS, 2007, 101 (06) : 250 - 254
  • [35] Linear-Time Construction of Two-Dimensional Suffix Trees
    Dong Kyue Kim
    Joong Chae Na
    Jeong Seop Sim
    Kunsoo Park
    Algorithmica, 2011, 59 : 269 - 297
  • [36] Fast construction of generalized suffix trees over a very large alphabet
    Chen, Zhixiang
    Fowler, Richard
    Fu, Ada Wai-Chee
    Wang, Chunyue
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2003, 2697 : 284 - 293
  • [37] Converting suffix trees into factor/suffix oracles
    Rusu, Irena
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (02) : 324 - 340
  • [38] Distributed suffix trees
    Clifford, Raphael
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 176 - 197
  • [39] Suffix Trees on Words
    A. Andersson
    N. J. Larsson
    K. Swanson
    Algorithmica, 1999, 23 : 246 - 260
  • [40] 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
12345