Figure 1. An example Suffix Tarray for the reference sequence “ATCTTCAAGA”.

A trie (truncated suffix tree) for “AGAACTTCTA” is built on the top of an FM-index. Each node of the trie stores k and l, where [k, l] is the SA interval of the substring that corresponds to the leaf node on the FM-index.