Scalable Parallel Suffix Array Construction

DOI10.1007/978-3-540-36183-1_39OpenAlexW4206797055MaRDI QIDQ4643558

Fabian Kulla, Peter Sanders

Publication date: 24 May 2018

Published in: High Performance Computing in Science and Engineering ’06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-36183-1_39

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Related Items (6)

Parallel lightweight wavelet tree, suffix array and FM-index construction ⋮ Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Suffix array and Lyndon factorization of a text ⋮ Parallel suffix sorting for large string analytics ⋮ Efficient chain code compression with interpolative coding ⋮ Scalable Parallel Suffix Array Construction

Cites Work

• Parallel sorting by regular sampling
• Scalable Parallel Suffix Array Construction
• Better external memory suffix array construction
• Unnamed Item
• Unnamed Item

This page was built for publication: Scalable Parallel Suffix Array Construction