Skip to main content


Fig. 3 | Algorithms for Molecular Biology

Fig. 3

From: Prefix-free parsing for building big BWTs

Fig. 3

The suffix array for our example is the sequence of values stored in the leaves of the tree (which we need not store explicitly). The LF mapping is shown as the arrows between two copies of the suffix array; the arrows to values i such that \(T [\mathrm {SA}[\it{i}]] = \mathtt {A}\) are in red, to illustrate that they point to consecutive positions in the suffix array and do not cross. Since \(\Psi\) is the inverse of the LF mapping, it can be obtained by simply reversing the direction of the arrows

Back to article page