Distributed suffix trees
From MaRDI portal
Publication:2569396
DOI10.1016/j.jda.2004.08.004zbMath1101.68502OpenAlexW2091071112MaRDI QIDQ2569396
Publication date: 27 October 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.004
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved behaviour of tries by adaptive branching
- An efficient algorithm for the all pairs suffix-prefix problem
- Suffix trees on words
- Sublinear approximate string matching and biological applications
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- On-line construction of suffix trees
- The string B-tree
- Fast Lightweight Suffix Array Construction and Checking
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Optimal parallel suffix tree construction