These notes from Lecture 12 cover the following topics: notation; suffix arrays; construction; pattern lookup; LCP enhancement; structure of a suffix array permutation; burrows wheeler transform; fast counts.
Please be advised that external sites may have terms and conditions,
including license rights, that differ from ours. MIT OCW is not responsible
for any content on third party sites, nor does a link suggest an endorsement
of those sites and/or their content.