Improving on-line construction of two-dimensional suffix trees for square matrices
DOI10.1016/J.IPL.2009.01.026zbMATH Open1214.68460OpenAlexW2044405965MaRDI QIDQ987807FDOQ987807
Authors: Joong Chae Na, Namhee Kim, J. S. Sim, Dong Kyue Kim 
Publication date: 16 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.026
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
randomized algorithmsdesign of algorithmson-line algorithmsindex data structurestwo-dimensional suffix trees
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Data structures (68P05)
Cites Work
- Efficient randomized pattern-matching algorithms
- A Space-Economical Suffix Tree Construction Algorithm
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- On-line construction of suffix trees
- Faster Suffix Tree Construction with Missing Suffix Links
- On the sorting-complexity of suffix tree construction
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On-line construction of two-dimensional suffix trees
Cited In (6)
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- Linear-time construction of two-dimensional suffix trees
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- On-line construction of parameterized suffix trees for large alphabets
- Computing and Combinatorics
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)
