Visualization of the ${BWT}_T$, ${SA}_T$, and ${LCP}_T$ for the example introduced in the Prefix-free parsing section. For clarity, the ${BWT}_T$ matrix is shown in each subfigure to highlight the information captured by each data structure. (A) The ${BWT}_T$. In the ${BWT}_T$ matrix, only the first (C) and last (${BWT}_T$) columns are highlighted; these columns are annotated with character ranks as subscripts, although in practice these ranks are computed using an auxiliary data structure. To the left of the first column, we illustrate how the C array is populated, and to the right of the last column we show the maximal character runs in the ${BWT}_T$. Also shown is how pattern matching is performed using the C array and ${BWT}_T$. (B) The ${SA}_T$. In the ${BWT}_T$ matrix, the suffixes of T$ that prefix each rotation are highlighted. (C) The ${LCP}_T$. In the ${BWT}_T$ matrix, the longest common prefix between consecutive rotations of T$ is highlighted.