Fast and lightweight distributed suffix array construction

DOI10.4230/LIPICS.ESA.2025.47MaRDI QIDQ7322443zbMATH OpenFDO

Authors Manuel Haag, Florian Kurpicz, Peter Sanders, Matthias Schimek

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.47

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Better external memory suffix array construction
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Concentration inequalities. A nonasymptotic theory of independence
• Fully functional suffix trees and optimal text searching in BWT-runs bounded space
• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• Lightweight distributed suffix array construction
• Linear work suffix array construction
• Linear-time suffix sorting -- a new approach for suffix array construction
• Opportunistic data structures with applications
• Parallel sorting by regular sampling
• Quorums from difference covers
• Replacing suffix trees with enhanced suffix arrays
• Robust massively parallel sorting
• Scalable distributed string sorting
• Sequential and parallel algorithms and data structures. The basic toolbox
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: Fast and lightweight distributed suffix array construction

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