Optimal parallel suffix tree construction
From MaRDI portal
Publication:5890842
DOI10.1145/195058.195162zbMath1345.68302OpenAlexW1966318226MaRDI QIDQ5890842
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195162
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)
Related Items (3)
Parallel algorithms for Burrows-Wheeler compression and decompression ⋮ On-line construction of two-dimensional suffix trees ⋮ Distributed suffix trees
This page was built for publication: Optimal parallel suffix tree construction
