Optimal logarithmic time randomized suffix tree construction
From MaRDI portal
Recommendations
- Sparse suffix tree construction in optimal time and space
- On the sorting-complexity of suffix tree construction
- Optimal parallel suffix tree construction
- Optimal parallel suffix tree construction
- A note on random suffix search trees
- Fast construction of generalized suffix trees over a very large alphabet
- Constructing optimal search trees in optimal time
- Linear-time period computation of a string with suffix trees
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
Cited in
(19)- Parallel construction of a suffix tree with applications
- Parallel construction and query of index data structures for pattern matching on square matrices
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Symmetry breaking for suffix tree construction
- Optimal parallel randomized renaming
- Faster suffix tree construction with missing suffix links
- scientific article; zbMATH DE number 4047160 (Why is no real title available?)
- Faster Suffix Tree Construction with Missing Suffix Links
- Random suffix search trees
- Constructing the suffix tree of a tree with a large alphabet
- A simple parallel Cartesian tree algorithm and its application to suffix tree construction
- On the sorting-complexity of suffix tree construction
- \(O ( n^{2} \log n )\) time on-line construction of two-dimensional suffix trees
- Optimal parallel suffix tree construction
- On-line construction of two-dimensional suffix trees
- Optimal parallel suffix tree construction
- Linear-time construction of two-dimensional suffix trees
This page was built for publication: Optimal logarithmic time randomized suffix tree construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818865)