1, write down all the permutations of the string of character ;

2, sort these rows according to the first character of each row;

3, the last coloumn is the result string.

BWT reverse:

1, write down the result string transformed by BWT;

2, sort with the same way of BWT.

3. add the BWT result in front of 2‘s result.

4.repeat the above until the matrix is square.

5.the final square matrix‘s last column is our result.

Burrows-Wheeler Transform