Constructing generalized suffix trees on distributed parallel platforms

DOI10.1007/S10559-023-00541-XMaRDI QIDQ6160551zbMATHOpenAlexFDO

Authors

Publication date 10 May 2023

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-023-00541-x

zbMATH Keywords

suffix treegeneralized suffix treeparallel construction of suffix tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 4047160
• Optimal parallel suffix tree construction
• Distributed suffix trees
• Optimal parallel suffix tree construction
• Lightweight distributed suffix array construction

Cites work

• Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15--17, 2002. Proceedings
• Counter based suffix tree for DNA pattern repeats
• On-line construction of suffix trees
• Optimal multi-way number partitioning
• The graph-bin packing problem

Cited in

(1)

• Parallel suffix sorting for large string analytics

This page was built for publication: Constructing generalized suffix trees on distributed parallel platforms

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