Parallel construction of a suffix tree

Author(s):  
Gad M. Landau ◽  
Baruch Schieber ◽  
Uzi Vishkin
1996 ◽  
Vol 06 (01) ◽  
pp. 35-44 ◽  
Author(s):  
DANY BRESLAUER ◽  
RAMESH HARIHARAN

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.


Algorithmica ◽  
1988 ◽  
Vol 3 (1-4) ◽  
pp. 347-365 ◽  
Author(s):  
A. Apostolico ◽  
C. Iliopoulos ◽  
G. M. Landau ◽  
B. Schieber ◽  
U. Vishkin

1995 ◽  
Vol 2 (16) ◽  
Author(s):  
Dany Breslauer ◽  
Ramesh Hariharan

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor automata and suffix trees.


Sign in / Sign up

Export Citation Format

Share Document