Generalizations of suffix arrays to multi-dimensional matrices.

DOI10.1016/S0304-3975(02)00828-9MaRDI QIDQ1401328zbMATH OpenFDO

Authors Dong Kyue Kim, Yoo-Ah Kim, Kunsoo Park

Publication date 17 August 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00828-9

zbMATH Keywords

Indexed data structuresMulti-dimensional matricesPattern retrievalSuffix array

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Generalizations of suffix arrays to multi-dimensional matrices.
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• scientific article; zbMATH DE number 437565
• 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

Cites work

• A Generalization of the Suffix Tree to Square Matrices, with Applications
• A linear time solution to the single function coarsest partition problem
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Alphabet-Independent Two-Dimensional Witness Computation
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• An optimal algorithm for computing the repetitions in a word
• Approximate string matching with suffix automata
• Covering a string
• Fast parallel and serial approximate string matching
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 3913713 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 1044854 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
• On the computational power of pushdown automata
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• Three Partition Refinement Algorithms
• Two-dimensional dictionary matching

Cited in

(6)

• Multistring based matrices
• Structural Pattern Matching - Succinctly.
• Generalizations of suffix arrays to multi-dimensional matrices.
• Suffix arrays for multiple strings: a method for on-line multiple string searches
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• Two-dimensional longest common extension queries in compact space

This page was built for publication: Generalizations of suffix arrays to multi-dimensional matrices.

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