Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix
trees and described the first algorithms for suffix array construction and use. Since that time …

Suffix trees and suffix arrays are widely used and largely interchangeable index structures
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …

A suffix array represents the suffixes of a string in sorted order. Being a simpler and more
compact alternative to suffix trees, it is an important tool for full text indexing and other string …

We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of
integers. The sorted order of suffixes of a string is also called suffix array, a data structure …

The time complexity of suffix tree construction has been shown to be equivalent to that of
sorting: O (n) for a constant-size alphabet or an integer alphabet and O (n log n) for a …

We present, in this paper, two efficient algorithms for linear time suffix array construction.
These two algorithms achieve their linear time complexities, using the techniques of divide …

We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of
integers. The sorted order of suffixes of a string is also called suffix array, a data structure …

A compressed full-text self-index represents a text in a compressed form and still answers
queries efficiently. This represents a significant advancement over the (full-) text indexing …

In this paper we describe a new algorithm for building the suffix array of a string. This task is
equivalent to the problem of lexicographically sorting all the suffixes of the input string. Our …