Parallel external memory suffix array construction

[back to the main page]

We present a C++ implementation of the first parallel external memory suffix array construction algorithm. The basic idea of the algorithm is to first construct the suffix arrays for blocks of text and then merge them into the full suffix array.

Details of the algorithm and experimental evaluation can be found in [1].
For more information, see README provided with the package.


Implemented by

See also


  1. Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi. Parallel External Memory Suffix Sorting. In Proc. 26th Symposium on Combinatorial Pattern Matching (CPM 2015), Springer, 2015, pp. 329-342.