Initial string:

    banana$

Suffix array:

    6 : $
    5 : a$
    3 : ana$
    1 : anana$
    0 : banana$
    4 : na$
    2 : nana$

Rotations of initial string:

    $banana
    a$banan
    na$bana
    ana$ban
    nana$ba
    anana$b
    banana$

Burrows-Wheeler Matrix:

    $banana
    a$banan
    ana$ban
    anana$b
    banana$
    na$bana
    nana$ba


BWM, SA and Suffixes:

    $banana  6  $
    a$banan  5  a$
    ana$ban  3  ana$
    anana$b  1  anana$
    banana$  0  banana$
    na$bana  4  na$
    nana$ba  2  nana$


Burrows-Wheeler Transform:

    annb$aa

Recover the BWM from the BWT:

Add 1:
    a
    n
    n
    b
    $
    a
    a

Sort 1:
    $
    a
    a
    a
    b
    n
    n

Add 2:
    a$
    na
    na
    ba
    $b
    an
    an

Sort 2:
    $b
    a$
    an
    an
    ba
    na
    na

Add 3:
    a$b
    na$
    nan
    ban
    $ba
    ana
    ana

Sort 3:
    $ba
    a$b
    ana
    ana
    ban
    na$
    nan

Add 4:
    a$ba
    na$b
    nana
    bana
    $ban
    ana$
    anan

Sort 4:
    $ban
    a$ba
    ana$
    anan
    bana
    na$b
    nana

Add 5:
    a$ban
    na$ba
    nana$
    banan
    $bana
    ana$b
    anana

Sort 5:
    $bana
    a$ban
    ana$b
    anana
    banan
    na$ba
    nana$

Add 6:
    a$bana
    na$ban
    nana$b
    banana
    $banan
    ana$ba
    anana$

Sort 6:
    $banan
    a$bana
    ana$ba
    anana$
    banana
    na$ban
    nana$b

Add 7:
    a$banan
    na$bana
    nana$ba
    banana$
    $banana
    ana$ban
    anana$b

Sort 7:
    $banana
    a$banan
    ana$ban
    anana$b
    banana$
    na$bana
    nana$ba


Recovered BWM:

    $banana
    a$banan
    ana$ban
    anana$b
    banana$
    na$bana
    nana$ba