On the construction of classes of suffix trees for square matrices: Algorithms and applications
From MaRDI portal
Publication:675052
Recommendations
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- Improving on-line construction of two-dimensional suffix trees for square matrices
- Fast construction of generalized suffix trees over a very large alphabet
- Parallel construction of a suffix tree with applications
- Generalizations of suffix arrays to multi-dimensional matrices.
- Generalizations of suffix arrays to multi-dimensional matrices.
- Linear-time construction of two-dimensional suffix trees
- On the sorting-complexity of suffix tree construction
Cited in
(13)- Linear-time construction of two-dimensional suffix trees
- TREE-BASED 2D INDEXING
- Generalizations of suffix arrays to multi-dimensional matrices.
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations
- Compressibility measures for two-dimensional data
- Generalizations of suffix arrays to multi-dimensional matrices.
- A note on a tree-based 2D indexing
- On the construction of classes of suffix trees for square matrices: algorithms and applications
- Improving on-line construction of two-dimensional suffix trees for square matrices
- Two-dimensional pattern matching with rotations
- Real two dimensional scaled matching
- Parallel construction and query of index data structures for pattern matching on square matrices
- On-line construction of two-dimensional suffix trees
This page was built for publication: On the construction of classes of suffix trees for square matrices: Algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675052)
