Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient implementation of suffix trees
Software—Practice & Experience
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
| Hi-index | 0.00 |
This paper considers the construction of the suffix array of a string on the MasPar MP-2 architecture. suffix arrays are space-efficient variants of the suffix trees, a fundamental dictionary data structure that is the backbone of many string algorithms for pattern matching and textual information retreival. We adapt known PRAM techniques for implementation on the MasPar: bulletin boards, doubling techniques and sorting methods. Performance results are presented.