Linear-time construction of two-dimensional suffix trees
From MaRDI portal
Publication:627547
DOI10.1007/s00453-009-9350-zzbMath1213.68228OpenAlexW2089446956MaRDI QIDQ627547
Jeong Seop Sim, Joong Chae Na, Dong Kyue Kim, Kun Soo Park
Publication date: 2 March 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9350-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the construction of classes of suffix trees for square matrices: Algorithms and applications
- Two-dimensional dictionary matching
- On the complexity of computations under varying sets of primitives
- A data structure for dynamic trees
- On-line construction of suffix trees
- Parameterized pattern matching: Algorithms and applications
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Constructing suffix arrays in linear time
- Space efficient linear time construction of suffix arrays
- Fast Algorithms for Finding Nearest Common Ancestors
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Linear Algorithm for Data Compression via String Matching
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Faster Suffix Tree Construction with Missing Suffix Links
- Jewels of Stringology
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- On the sorting-complexity of suffix tree construction
- On-line construction of two-dimensional suffix trees
- Generalizations of suffix arrays to multi-dimensional matrices.
This page was built for publication: Linear-time construction of two-dimensional suffix trees
