Lightweight distributed suffix array construction

DOI10.1137/1.9781611975499.3MaRDI QIDQ5232749zbMATH OpenOpenAlexFDO

Authors Johannes Fischer, Florian Kurpicz

Publication date 13 September 2019

Published in 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975499.3

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Distributed algorithms (68W15)

Recommendations

• Engineering a lightweight suffix array construction algorithm
• Linear work suffix array construction
• Engineering a lightweight external memory suffix array construction algorithm
• Better external memory suffix array construction
• scientific article; zbMATH DE number 1947433

Cited in

(5)

• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Constructing generalized suffix trees on distributed parallel platforms
• Scalable distributed string sorting
• Distributed suffix trees

This page was built for publication: Lightweight distributed suffix array construction

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