Symmetry breaking for suffix tree construction
From MaRDI portal
Publication:2817621
DOI10.1145/195058.195164zbMath1345.68306OpenAlexW2023186784MaRDI QIDQ2817621
Sühleyman Cenk Sahinalp, Uzi Vishkin
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.195164
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)
Related Items
Text sparsification via local maxima. ⋮ Unnamed Item ⋮ Parallel algorithms for Burrows-Wheeler compression and decompression ⋮ On-line construction of two-dimensional suffix trees ⋮ Optimal parallel suffix tree construction ⋮ Parallel computation of the Burrows Wheeler transform in compact space ⋮ Random suffix search trees ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ Constructing suffix arrays in linear time
