Scalable Parallel Suffix Array Construction

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

Authors: 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

Recommendations

• Linear work suffix array construction
• An elegant algorithm for the construction of suffix arrays
• Better external memory suffix array construction
• Fast, parallel, and cache-friendly suffix array construction
• Lightweight distributed suffix array construction

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Cites Work

• Title not available (Why is that?)
• Scalable Parallel Suffix Array Construction
• Better external memory suffix array construction
• Parallel sorting by regular sampling
• Title not available (Why is that?)

Cited In (11)

• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Parallel suffix sorting for large string analytics
• Extended suffix array construction using Lyndon factors
• Suffix array and Lyndon factorization of a text
• Can Burrows-Wheeler transform be replaced in chain code compression?
• On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
• Fast, parallel, and cache-friendly suffix array construction
• Efficient chain code compression with interpolative coding
• Scalable Suffix Sorting on a Multicore Machine
• Parallel External Memory Suffix Sorting
• Scalable Parallel Suffix Array Construction

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643558)