On the combinatorics of suffix arrays
A new bijective combinatorial characterization of suffix array permutations is obtained. An existing characterization of BurrowsWheeler transform can be advantageously applied to suffix arrays. A known suffix array characterization for binary alphabet is easily obtained through our approach. Known counting results can be obtained more simply with our characterization.
suffix array permutations burrowswheeler transform combinatorial problems