The suffix tree of a text T is … [p. 8] The suffix array [refs] is simply a … [p. 19] the Burrows-Wheeler transform [T^bwt] … is formed by sequentially traversing the suffix array … [T^bwt] can be reversed back to the text, … [p. 45] While [suffix arrays are] clearly the most popular trend … on Lempel-Ziv compression.
Google-1
Google-2
Copyright clearance needed for quotation.