Parallel Construction of Minimal Suffix and Factor Automata

Abstract We show that the constructions of directed acyclic word graphs (dawg's) and of minimal suffix and minimal factor automata can be done by almost optimal parallel algorithms (optimal within logarithmic factor). In the concurrent-write model our algorithms work in log n time and in the exclusive-write model they work in log2n time. The number of employed processors is linear. Hence our constructions have the same complexity as the best known parallel algorithms computing suffix trees. A relationship between dawg's and suffix trees is exploited; we make essential use of the parallel algorithm for the construction of suffix trees of Apostolico et al.

[1]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .

[2]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[3]  Maxime Crochemore,et al.  Transducers and Repetitions , 1986, Theor. Comput. Sci..

[4]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[5]  Gad M. Landau,et al.  Parallel Construction of a Suffix Tree (Extended Abstract) , 1987, ICALP.

[6]  J. Seiferas,et al.  Efficient and Elegant Subword-Tree Construction , 1985 .

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[9]  Krzysztof Diks,et al.  Testing Isomorphism of Outerplanar Graphs in Parallel , 1988, MFCS.

[10]  David Haussler,et al.  The Smallest Automaton Recognizing the Subwords of a Text , 1985, Theor. Comput. Sci..

[11]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[12]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[13]  David Haussler,et al.  Complete inverted files for efficient text retrieval and analysis , 1987, JACM.

[14]  Wojciech Rytter.  A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata , 1989, Inf. Process. Lett..

[15]  Wojciech Rytter,et al.  Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays , 1991, Theor. Comput. Sci..