On the construction of classes of suffix trees for square matrices: Algorithms and applications
From MaRDI portal
Publication:675052
DOI10.1006/INCO.1996.0087zbMath0876.68028OpenAlexW2036179805MaRDI QIDQ675052
Roberto Grossi, Raffaele Giancarlo
Publication date: 6 March 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0087
Related Items (10)
Two-dimensional pattern matching with rotations ⋮ TREE-BASED 2D INDEXING ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Linear-time construction of two-dimensional suffix trees ⋮ On-line construction of two-dimensional suffix trees ⋮ A Note on a Tree-Based 2D Indexing ⋮ Real two dimensional scaled matching ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Parallel construction and query of index data structures for pattern matching on square matrices ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations
This page was built for publication: On the construction of classes of suffix trees for square matrices: Algorithms and applications
