Abstract
The purpose of these lectures is to give a quick, but rigorous introduction to the most fundamental and general algorithmic techniques that arise in biological sequence analysis, and to review open problems in the probability of sequence alignment. Some specific computer programs or services might be mentioned in passing, but the lectures are not intended to give advice on current computer programs.
This fourth mini course will cover the Burrows-Wheeler transform: its relationship to suffix arrays, pattern matching, its modern use in compression and in solving a range of biological sequence problems.
The first session of this mini course will take place on Tuesday, January 19 from 9:30 am – 10:30 am; the second session of this mini course will take place on Tuesday, January 19 from 11:00 am – 12:00 pm; the third session of this mini course will take place on Tuesday, January 19 from 1:30 pm – 2:30 pm.