A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present a bijective characterization of suffix array permutations obtained from a characterization of Burrows-Wheeler arrays given in  . We show that previous characterizations [2, 3, 4] , or their analogs, can be obtained in a simple and elegant way using this relationship. To demonstrate the usefulness of our approach, we obtain simpler proofs for some known enumeration results about suffix arrays  . Our characterization of suffix arrays is the first based on their relationship with Burrows-Wheeler permutations.doi:10.1016/j.ipl.2013.09.009 fatcat:2udknaaxhzfmfhi22dvgghggaq