A Generalization of the Suffix Tree to Square Matrices, with Applications

DOI10.1137/S0097539792231982MaRDI QIDQ4842120zbMATH OpenOpenAlexFDO

Authors R. Giancarlo

Publication date 18 March 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539792231982

zbMATH Keywords

Lsuffix treetwo-dimensional dictionary matchingtwo-dimensional pattern retrieval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• scientific article; zbMATH DE number 437565
• On the construction of classes of suffix trees for square matrices: algorithms and applications
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• Parallel construction and query of index data structures for pattern matching on square matrices
• Two-dimensional prefix string matching and covering on square matrices

Cited in

(29)

• On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
• Improving on-line construction of two-dimensional suffix trees for square matrices
• Two-dimensional dynamic dictionary matching
• Suffix arrays for multiple strings: a method for on-line multiple string searches
• Generalizations of suffix arrays to multi-dimensional matrices.
• Finding maximal 2-dimensional palindromes
• On updating suffix tree labels
• scientific article; zbMATH DE number 7559174 (Why is no real title available?)
• An index data structure for matrices, with applications to fast two-dimensional pattern matching
• scientific article; zbMATH DE number 437565 (Why is no real title available?)
• Dynamic suffix tree and two-dimensional texts management
• On the construction of classes of suffix trees for square matrices: algorithms and applications
• Parallel construction and query of index data structures for pattern matching on square matrices
• The submatrices character count problem: An efficient solution using separable values
• Finding patterns and periods in Cartesian tree matching
• Two-dimensional pattern matching on a dynamic library of texts
• Generalization of repetitiveness measures for two-dimensional strings
• Linear-time construction of two-dimensional suffix trees
• Cartesian Tree Matching and Indexing
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• On-line construction of two-dimensional suffix trees
• Optimal bounds for distinct quartics
• Generalizations of suffix arrays to multi-dimensional matrices.
• \(LZ\)-based image compression
• 2D Lyndon words and applications
• A note on a tree-based 2D indexing
• Compressibility measures for two-dimensional data
• TREE-BASED 2D INDEXING
• Sequential and indexed two-dimensional combinatorial template matching allowing rotations

This page was built for publication: A Generalization of the Suffix Tree to Square Matrices, with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4842120)