From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
From MaRDI portal
Publication:1386367
Recommendations
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- Linear-time construction of suffix arrays (extended abstract)
- Linear-time construction of two-dimensional suffix trees
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On the sorting-complexity of suffix tree construction
- Linear-time period computation of a string with suffix trees
- scientific article; zbMATH DE number 2102777
- Linear-time suffix sorting -- a new approach for suffix array construction
- Sparse suffix tree construction in optimal time and space
- Fast construction of generalized suffix trees over a very large alphabet
Cited in
(22)- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- Irredundant tandem motifs
- scientific article; zbMATH DE number 2102777 (Why is no real title available?)
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- Time optimal left to right construction of position trees
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- On-line suffix tree construction with reduced branching
- Dynamic construction of an antidictionary with linear complexity
- Collage system: A unifying framework for compressed pattern matching.
- Linear bidirectional on-line construction of affix trees
- Truncated suffix trees and their application to data compression.
- Distributed suffix trees
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Computing suffix links for suffix trees and arrays
- On-line construction of suffix trees
- Fast construction of generalized suffix trees over a very large alphabet
- scientific article; zbMATH DE number 1615290 (Why is no real title available?)
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Near real-time suffix tree construction via the fringe marked ancestor problem
- On suffix extensions in suffix trees
- Online Suffix Tree Construction for Streaming Sequences
- On-line construction of parameterized suffix trees for large alphabets
This page was built for publication: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386367)
