Optimal parallel suffix tree construction

DOI10.1145/195058.195162MaRDI QIDQ5890842zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan

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

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• Optimal parallel suffix tree construction
• Parallel construction of a suffix tree with applications
• scientific article; zbMATH DE number 2102777
• scientific article; zbMATH DE number 4047160
• A simple parallel Cartesian tree algorithm and its application to suffix tree construction

Cited in

(18)

• Parallel construction of a suffix tree with applications
• Sorting strings and constructing digital search trees in parallel
• Parallel construction of succinct trees
• Parallel algorithms for Burrows-Wheeler compression and decompression
• Distributed suffix trees
• Symmetry breaking for suffix tree construction
• scientific article; zbMATH DE number 1003282 (Why is no real title available?)
• Optimal parallel generation of a computation tree form
• scientific article; zbMATH DE number 4047160 (Why is no real title available?)
• scientific article; zbMATH DE number 18629 (Why is no real title available?)
• scientific article; zbMATH DE number 2102777 (Why is no real title available?)
• A simple parallel Cartesian tree algorithm and its application to suffix tree construction
• Space-efficient parallel construction of succinct representations of suffix tree topologies
• On-line construction of two-dimensional suffix trees
• Optimal parallel suffix tree construction
• Constructing generalized suffix trees on distributed parallel platforms
• Constructing large suffix trees on a computational grid
• Parallel construction of minimal suffix and factor automata

This page was built for publication: Optimal parallel suffix tree construction

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