Parallel External Memory Suffix Sorting

DOI10.1007/978-3-319-19929-0_28zbMath1432.68110OpenAlexW2400487982MaRDI QIDQ2942270

Simon J. Puglisi, Dominik Kempa, Juha Kärkkäinen

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_28

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items (8)

Parallel lightweight wavelet tree, suffix array and FM-index construction ⋮ In-place algorithms for exact and approximate shortest unique substring problems ⋮ Better External Memory LCP Array Construction ⋮ Bidirectional Text Compression in External Memory ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ Constructing antidictionaries of long texts in output-sensitive space ⋮ LCP Array Construction in External Memory ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies

This page was built for publication: Parallel External Memory Suffix Sorting