Fast, parallel, and cache-friendly suffix array construction

DOI10.4230/LIPICS.WABI.2023.16MaRDI QIDQ6651045zbMATH OpenFDO

Authors Jamshed Khan, Tobias Rubel, Laxman Dhulipala, Erin K. Molloy, R. Patro

Publication date 9 December 2024

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2023.16

zbMATH Keywords

data structureslongest common prefixparallel algorithmssuffix arrayindexing

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Scalable Parallel Suffix Array Construction
• Linear work suffix array construction
• An elegant algorithm for the construction of suffix arrays
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Better external memory LCP array construction

Cited in

(1)

• Parallel suffix sorting for large string analytics

This page was built for publication: Fast, parallel, and cache-friendly suffix array construction

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