Reconstructing a Suffix Array

Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder). It thus becomes of interest to study possible alternate orderings of the suffixes in these data structures, that may be easier to construct or more efficient to use. In this paper we consider the "reconstruction" of a suffix array based on a given reordering of the alphabet, and we describe simple timeand space-efficient algorithms that accomplish it.

• Type: Journal
• Year: 2006
• Where: IJFCS
• Authors: Frantisek Franek, William F. Smyth
• Keywords: Data Compression Applications, IJFCS 2006, Possible Alternate Orderings, Suffix Tree