Distributed suffix trees
From MaRDI portal
Publication:2569396
DOI10.1016/J.JDA.2004.08.004zbMATH Open1101.68502OpenAlexW2091071112MaRDI QIDQ2569396FDOQ2569396
Authors: Raphaël Clifford 
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
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- The string B-tree
- Title not available (Why is that?)
- A Space-Economical Suffix Tree Construction Algorithm
- An efficient algorithm for the all pairs suffix-prefix problem
- On-line construction of suffix trees
- Title not available (Why is that?)
- Sublinear approximate string matching and biological applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Fast lightweight suffix array construction and checking
- Suffix trees on words
- Improved behaviour of tries by adaptive branching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal parallel suffix tree construction
Cited In (5)
- Distributed and paged suffix trees for large genetic databases
- Constructing generalized suffix trees on distributed parallel platforms
- PSIST: a scalable approach to indexing protein structures using suffix trees
- Constructing large suffix trees on a computational grid
- String Processing and Information Retrieval
Uses Software
This page was built for publication: Distributed suffix trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569396)
