Fig. 1
From: An optimized FM-index library for nucleotide and amino acid search
Example of generating a Burrows-Wheeler Transform for a given text. A All rotations of the input text ‘banana’, with appended sentinel ‘$’ symbol. The position of each rotation is given in the left column. B After sorting the rotations, the left column retains the original position of each rotation, and is thus the suffix array of the text. The final column of this sorted rotation matrix is the BWT. The actual rotation matrix need not be stored, or even computed; it is represented here as a visual aid