Abstract

Suffix arrays and suffix binary search trees are two data structures that have been proposed as alternatives to the classical suffix tree to facilitate efficient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suffix array, with its auxiliary information, as a perfectly balanced suffix binary search tree, and describe an elegant and efficient algorithm to construct the suffix array and its auxiliaries from an arbitrary suffix binary search tree. 1

Citations