On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications

  title={On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications},
  author={Raffaele Giancarlo and Roberto Grossi},
  journal={Inf. Comput.},
Given an n × n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4n−1 classes of index data structures for TEXT. Those indices are informally the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on TEXT. We provide one simple algorithm that efficiently builds any chosen index in those classes in O(n2 log n) worst case time using O(n2) space. The algorithm can be modified to require optimal O(n2) expected… 

On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time

The main contribution in this paper is an O(log n) factor improvement in the time complexity of the GG algorithm, making it optimal for unbounded alphabets and leading to a major simplification of theGG algorithm.

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time

A new and simple algorithm to construct two-dimensional suffix trees in linear time by applying the skew scheme to square matrices is proposed.

Linear-Time Construction of Two-Dimensional Suffix Trees

This work presents the first linear-time algorithm for constructing two-dimensional suffix trees, a compacted trie that represents all suffixes of S in two dimensions.

Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices

Fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices, including the Lsuffix tree, which is a generalization of the classical suffix tree for strings.

An Index for Two Dimensional String Matching Allowing Rotations

An index to search aTwo-dimensional pattern of size m × m in a two-dimensional text of size n × n, even when the pattern appears rotated in the text is presented, based on (path compressed) tries.

Entropy-Compressed Indexes for Multidimensional Pattern Matching

The challenges involved in developing a multidimensional generalizations of compressed text indexing structures are discussed and the 2D case is studied to possibly highlight combinatorial properties that do not emerge in the 1D case.

Linear-Time Construction of Two-Dimensional Suffix Trees

This work presents the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree of a matrix A by applying a divide-and-conquer approach.

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

A new multidimensional pattern matching problem that is a natural generalization of string matching, a well studied problem, and derives the first efficient sequential algorithms for the new problem.

Optimal on-line search and sublinear time update in string matching

  • P. FerraginaR. Grossi
  • Computer Science
    Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
This work is presenting the first dynamic algorithm that achieves optimal time to find the occ occurrences of P, and sublinear time per update, i.e. O(/spl radic/(n+y)), in the worst case.

The Burrows-Wheeler Transform : Ten Years Later

The FM-index is a succinct text index needing only O(Hkn) bits of space, with the constant factor depending only logarithmically on σ, which means in practice for all but very small alphabets, even with huge texts.



An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching

It is shown that the s-trees are optimal for space and within a log factor optimal for time.

Parallel construction and query of suffix trees for two-dimensional matrices

The problem of bnildlng a tree data structure representing all rectangular submatrices of a given matrix has been shown to be computationally harder than the problem of building a treeData structure representing only the square submatrix of aGiven matrix, so the attention for the important special case of squareSubmatrices is justified.

The Suffix of a square matrix, with applications

We describe a new data structure, the Lst@ix tree, which is a generalization to a souare matrix of McCreieht’s suffix tree ‘ior a string ordered alohabet . All-matrices have entries ii a totally .

A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors

Several parameters of b-suffix trees are studied, namely, the Depth of a given suffix, the depth of insertion, the height and the shortest feasible path, to obtain several insights into certain algorithms on words, molecular biology, and universal data compression schemes.

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

A new data structure is described, the Lsuffix tree, which generalizes McCreight's suffix tree for a string to a square matrix and gives efficient algorithms for the static versions of the following dual problems that arise in low-level image processing and visual databases.

Fast Algorithms for Finding Nearest Common Ancestors

An algorithm for a random access machine with uniform cost measure (and a bound of $\Omega (\log n)$ on the number of bits per word) that requires time per query and preprocessing time is presented, assuming that the collection of trees is static.

A Space-Economical Suffix Tree Construction Algorithm

A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously

Rapid identification of repeated patterns in strings, trees and arrays

This paper describes a strategy for constructing efficient algorithms for solving two types of matching problems and develops explicit algorithms for these two problems applied to strings and arrays.

Efficient pattern matching with scaling

Two-Dimensional Dictionary Matching