Scalable parallel suffix array construction

Parallel Computing

Volumn 33, Issue 9, 2007, Pages 605-612

  Kulla, Fabian ^a   Sanders, Peter ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Data compression; Full text index; Parallel algorithm; Sorting

Indexed keywords

DATA COMPRESSION; INDEXING (OF INFORMATION); INTERFACES (COMPUTER); MESSAGE PASSING; PARALLEL ALGORITHMS; SORTING; TEXT PROCESSING;

FULL TEXT INDEX; PARALLELIZATION; SUFFIX ARRAY CONSTRUCTION;

DATA STRUCTURES;

EID: 34548685225     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2007.06.004     Document Type: Article

References (15)

1. Manber U., and Myers G. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22 5 (1993) 935-948
2. Gonnet G., Baeza-Yates R., and Snider T. New indices for text: PAT trees and PAT arrays. In: Frakes W.B., and Baeza-Yates R. (Eds). Information Retrieval: Data Structures & Algorithms (1992), Prentice-Hall 66-82
3. Abouelhoda M.I., Kurtz S., and Ohlebusch E. The enhanced suffix array and its applications to genome analysis. Proc. 2nd Workshop on Algorithms in Bioinformatics. LNCS vol. 2452 (2002), Springer 449-463
4. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Technical Report 124, SRC (digital, Palo Alto), May 1994.
5. Kärkkäinen J., and Sanders P. Simple linear work suffix array construction. 30th International Colloquium on Automata, Languages and Programming, Eindhoven. LNCS vol. 2719 (2003), Springer 943-955
6. Kim D.K., Sim J.S., Park H., and Park K. Linear-time construction of suffix arrays. Proc. 14th Annual Symposium on Combinatorial Pattern Matching. LNCS (2003), Springer 186-199
7. Ko P., and Aluru S. Space efficient linear time construction of suffix arrays. Proc. 14th Annual Symposium on Combinatorial Pattern Matching. LNCS vol. 2676 (2003), Springer 200-210
8. R. Dementiev, J. Kärkkäinen, J. Mehnert, P. Sanders, Better external memory suffix array construction, in: Workshop on Algorithm Engineering & Experiments, Vancouver, 2005, pp. 86-97.
9. C.S. Iliopoulos, W. Rytter, On parallel transformations of suffix arrays into suffix trees, in: 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), 2004.
10. Kärkkäinen J., Sanders P., and Burkhardt S. Linear work suffix array construction. Journal of the ACM 53 6 (2006) 1-19
11. Futamura N., Aluru S., and Kurtz S. Parallel suffix sorting. Proc. 9th International Conference on Advanced Computing and Communications (2001), Tata McGraw-Hill 76-81
12. Manzini G., and Ferragina P. Engineering a lightweight suffix array construction algorithm. Proc. 10th Annual European Symposium on Algorithms. LNCS vol. 2461 (2002), Springer 698-710
13. Shi H., and Schaeffer J. Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing 14 4 (1992) 361-372
14. Snir M., Otto S.W., Huss-Lederman S., Walker D.W., and Dongarra J. MPI-the Complete Reference (1996), MIT Press
15. B. Smyth, A. Turpin, The performance of linear time suffix sorting algorithms, in: IEEE Data Compression Conference, 2005, pp. 358-367.