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 …

The suffix tree is one of the most important data structures in string processing and
comparative genomics. However, the space consumption of the suffix tree is a bottleneck in …

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 …

Background The use of novel algorithmic techniques is pivotal to many important problems
in life science. For example the sequencing of the human genome [1] would not have been …

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 …

Background The use of novel algorithmic techniques is pivotal to many important problems
in life science. For example the sequencing of the human genome (Venter et al., 2001) …

A succinct full-text self-index is a data structure built on a text T= t 1 t 2... tn, which takes little
space (ideally close to that of the compressed text), permits efficient search for the …

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 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 …