OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA-Reference-Cited by-同舟云学术

OPTIMAL PARALLEL CONSTRUCTION OF MINIMAL SUFFIX AND FACTOR AUTOMATA

Published:1996-03 Issue:01 Volume:06 Page:35-44
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

BRESLAUER DANY¹,HARIHARAN RAMESH²

Affiliation:

1. BRICS — Basic Research in Computer Science, Centre of the Danish National Research Foundation, Department of Computer Science, University of Aarhus, DK-8000 Aarhus C, Denmark

2. Max Planck Institut für Informatik, Saarbrücken, 66123, Germany

Abstract

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626496000054

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets;Theoretical Computer Science;2023-09

2. A suffix tree or not a suffix tree?;Journal of Discrete Algorithms;2015-05

3. A Suffix Tree Or Not a Suffix Tree?;Lecture Notes in Computer Science;2015

4. Near real-time suffix tree construction via the fringe marked ancestor problem;Journal of Discrete Algorithms;2013-01

5. On suffix extensions in suffix trees;Theoretical Computer Science;2012-10