Improving on-line construction of two-dimensional suffix trees for square matrices
From MaRDI portal
(Redirected from Publication:987807)
Recommendations
- On-line construction of two-dimensional suffix trees
- On-line construction of two-dimensional suffix trees
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- Computing and Combinatorics
- Linear-time construction of two-dimensional suffix trees
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On-line construction of suffix trees
Cites work
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- A Space-Economical Suffix Tree Construction Algorithm
- Efficient randomized pattern-matching algorithms
- Faster Suffix Tree Construction with Missing Suffix Links
- On the sorting-complexity of suffix tree construction
- On-line construction of suffix trees
- On-line construction of two-dimensional suffix trees
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
Cited in
(6)- Linear-time construction of two-dimensional suffix trees
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Computing and Combinatorics
- On-line construction of parameterized suffix trees for large alphabets
This page was built for publication: Improving on-line construction of two-dimensional suffix trees for square matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987807)