Finally, we compute the LZ parse using a version of KKP3 for large
alphabets, relying on a suffix array construction algorithm for large
alphabets [1]}, [2]}. We then remap the output of LZ to point to positions
in \(T\)  as described.
