Optimal parallel construction of minimal suffix and factor automata

被引：0
|
作者：
Breslauer, Dany [1 ]
Hariharan, Ramesh [1 ]
机构：
[1] Univ of Aarhus, Aarhus, Denmark
来源：
Parallel processing letters | 1996年 / 6卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：35 / 44
相关论文
共 50 条
  • [1] PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA
    CROCHEMORE, M
    RYTTER, W
    INFORMATION PROCESSING LETTERS, 1990, 35 (03) : 121 - 128
  • [2] PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA
    CROCHEMORE, M
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 217 - 223
  • [3] Optimal parallel suffix tree construction
    Hariharan, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) : 44 - 69
  • [4] Scalable parallel suffix array construction
    Kulla, Fabian
    Sanders, Peter
    PARALLEL COMPUTING, 2007, 33 (09) : 605 - 612
  • [5] PARALLEL CONSTRUCTION OF A SUFFIX TREE WITH APPLICATIONS
    APOSTOLICO, A
    ILIOPOULOS, C
    LANDAU, GM
    SCHIEBER, B
    VISHKIN, U
    ALGORITHMICA, 1988, 3 (03) : 347 - 365
  • [6] Scalable parallel suffix array construction
    Kulla, Fabian
    Sanders, Peter
    HIGH PERFORMANCE COMPUTING IN SCIENCE AND ENGINEERING '06, 2007, : 543 - 546
  • [7] Massively parallel suffix array construction
    Iliopoulos, CS
    Korda, M
    SOFSEM'98: THEORY AND PRACTICE OF INFORMATICS, 1998, 1521 : 371 - 380
  • [8] Special factors and the combinatorics of suffix and factor automata
    Fici, Gabriele
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3604 - 3615
  • [9] Scalable parallel suffix array construction
    Kulla, Fabian
    Sanders, Peter
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 2006, 4192 : 22 - 29
  • [10] Bit-parallel (delta, gamma)-matching and suffix automata
    Crochemore, Maxime
    Iliopoulos, Costas S.
    Navarro, Gonzalo
    Pinzon, Yoan J.
    Salinger, Alejandro
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 198 - 214
12345