This is an old revision of the document!
The Burrows Wheeler Transform can be used to compress a suffix array, and is used in bwa.
The prefix trie is a tree built from possible prefixes, starting at the end of a branch and going backwards to the root. Each node is the range in the suffix array where the
The suffix array is found by sorting the cyclic transformation lexicographically and taking their original indices. Range in the suffix array can be found by the R_ and R-