On the construction of classes of suffix trees for square matrices: Algorithms and applications

R Giancarlo, R Grossi - information and computation, 1996 - Elsevier
We provide a uniform framework for the study of index data structures for a two-dimensional
matrixTEXT [1: n, 1: n] whose entries are drawn from an ordered alphabetΣ. An index …

Pattern matching in compressed texts and images

D Adjeroh, T Bell, A Mukherjee - Foundations and Trends® in …, 2013 - nowpublishers.com
This review provides a survey of techniques for pattern matching in compressed text and
images. Normally compressed data needs to be decompressed before it is processed, but if …

On the construction of classes of suffix trees for square matrices: algorithms and applications

R Giancarlo, R Grossi - International Colloquium on Automata, Languages …, 1995 - Springer
Given an n× n TEXT matrix with entries defined over an ordered alphabet σ, we introduce 4
n− 1 classes of index data structures for TEXT. Those indices are informally the two …

[PDF][PDF] Pattern recognition by data compression

P Johansen - … OF THE SCANDINAVIAN CONFERENCE ON IMAGE …, 1995 - Citeseer
Combinatorial pattern recognition is used for discrimination of handwritten signatures. The
method partitions an input image into overlap** pieces. A piece is as large as possible …