1. Home
    Item seperator
  3. Item seperator
    A Generalization of the Suffix Tree to Matrices, With Applications

A Generalization of the Suffix Tree to Matrices, With Applications

New Image

We devise a new data structure, the L-suffix, which is a generalization to square matrices of McCreight's suffix tree for a string[17]. Based on the L-suffix tree, we can solve the following problems in the given time bounds. All Matrices have their entries defined over an alphabet sigma. Pattern Retrieval Problem. We are given a n x n matrix TEXT which we are allowed to preprocess. Then, we are am x m matrix PATTERN and we find all occurrences of PATTERN in TEXT (query).