Burrows-Wheeler Transform, part 1

We discuss rotations of a string, and how a special "terminator" character can take the place of the special rules we use for alphabetical order. Then we discuss the Burrows-Wheeler Matrix (BWM) and Transform (BWT). We show that the BWT has the effect of ordering the characters of a string by their right context. We discuss how this order is another way of preparing to apply zero-order encoders to achieve similar compression to that achieved by higher-order encoders.

Channel: @Ben Langmead
Playlist: https://www.youtube.com/playlist?list=PL2mpR0RYFQsADmYpW2YWBrXJZ_6EL_3nu
More materials: http://www.langmead-lab.org/teaching-materials/

Видео Burrows-Wheeler Transform, part 1 канала Ben Langmead