Optimal parallel suffix tree construction

DOI10.1006/jcss.1997.1496zbMath0880.68056OpenAlexW2762948820MaRDI QIDQ5906825

Ramesh Hariharan

Publication date: 7 January 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1496

zbMATH Keywords

CREW-PRAM algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (3)

Parallel computation of the Burrows Wheeler transform in compact space ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ Constructing suffix arrays in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Structural properties of the string statistics problem
• Parallel construction of a suffix tree with applications
• Optimal off-line detection of repetitions in a string
• Improved deterministic parallel integer sorting
• Symmetry breaking for suffix tree construction
• Fast Algorithms for Finding Nearest Common Ancestors
• Parallel Merge Sort
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Linear Algorithm for Data Compression via String Matching
• A Space-Economical Suffix Tree Construction Algorithm
• Parallel Suffix–Prefix-Matching Algorithm and Applications

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