Constructing suffix trees on-line in linear time

被引：0
|
作者：
Ukkonen, E.
机构：
来源：
Proceedings of the IFIP World Computer Congress | 1992年 / 1卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Linear, bidirectional on-line construction of affix trees
    Maass, MG
    ALGORITHMICA, 2003, 37 (01) : 43 - 74
  • [22] Linear Bidirectional On-Line Construction of Affix Trees
    Algorithmica, 2003, 37 : 43 - 74
  • [23] 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 - +
  • [24] 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
  • [25] Linear-Time Construction of Two-Dimensional Suffix Trees
    Dong Kyue Kim
    Joong Chae Na
    Jeong Seop Sim
    Kunsoo Park
    Algorithmica, 2011, 59 : 269 - 297
  • [26] Constructing Generalized Suffix Trees on Distributed Parallel Platforms
    A. Hlybovets
    V. Didenko
    Cybernetics and Systems Analysis, 2023, 59 : 49 - 60
  • [27] Constructing Generalized Suffix Trees on Distributed Parallel Platforms
    Hlybovets, A.
    Didenko, V.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2023, 59 (01) : 49 - 60
  • [28] A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
    Mauricio Ayala-Rincón
    Paulo D. Conejo
    Algorithmica , 2003, 37 : 233 - 241
  • [29] A linear time lower bound on McCreight and general updating algorithms for suffix trees
    Ayala-Rincón, M
    Conejo, PD
    ALGORITHMICA, 2003, 37 (03) : 233 - 241
  • [30] On-line suffix tree construction with reduced branching
    Senft, Martin
    Dvorak, Tomas
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 12 : 48 - 60
12345