Optimal Parallel Suffix Tree Construction

Hariharan, Ramesh (1997) Optimal Parallel Suffix Tree Construction. In: Journal of Computer and System Sciences, 55 (1). pp. 44-69.

PDF Optimal_parallel_15_feb.pdf Restricted to Registered users only Download (655Kb) | Request a copy

Abstract

An O(m)-work, O(m)-space, $O(log^4 m)$-time CREW-PRAM algorithm for constructing the suffix tree of a string s of length m drawn from any fixed alphabet set is obtained. This is the first known work and space optimal parallel algorithm for this problem. It can be generalized to a string s drawn from any general alphabet set to perform in $O(log^4 m)$ time and $O(m log |\Sigma|)$ work and space, after the characters in s have been sorted alphabetically, where $|\Sigma|$ is the number of distinct characters in s. In this case too, the algorithm is work-optimal

Item Type:	Journal Article
Additional Information:	Copyright of this article belongs to Elsevier.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited:	23 Mar 2007
Last Modified:	19 Sep 2010 04:35
URI:	http://eprints.iisc.ernet.in/id/eprint/9830

Actions (login required)

View Item