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 . Based on the Lsuffix tree. we eive efficient algorithms for the static and dynamic ver&ns of the following problems that arise in many important applications in… CONTINUE READING