On the construction of classes of suffix trees for square matrices: Algorithms and applications
type: Item
instance of: scholarly article
title: On the construction of classes of suffix trees for square matrices: Algorithms and applications
zbMATH Open document ID: 0876.68028
author: R. Giancarlo
author: Roberto Grossi
published in: Information and Computation
publication date: 1997-03-06T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 987865
zbMATH Keywords: index data structures
MaRDI profile type: Publication
full work available at URL: inco.1996.0087
OpenAlex ID: W2036179805
DOI: 10.1006/INCO.1996.0087
Recommended article: On the construction of classes of suffix trees for square matrices: Algorithms and applications
Recommended article: A Generalization of the Suffix Tree to Square Matrices, with Applications
Recommended article: Improving on-line construction of two-dimensional suffix trees for square matrices
Recommended article: Fast Construction of Generalized Suffix Trees over a Very Large Alphabet
Recommended article: Parallel construction of a suffix tree with applications
Recommended article: Generalizations of suffix arrays to multi-dimensional matrices.
Recommended article: Linear-time construction of two-dimensional suffix trees
Recommended article: On the sorting-complexity of suffix tree construction
description: scientific article; zbMATH DE number 987865