lecture_notes:04-22-2011

**This is an old revision of the document!**

We discussed the bwa. It uses the Burrows Wheeler Transform to represent a prefix trie, allowing for short read alignment.

The prefix trie is a tree built from possible prefixes, starting at the end of a branch and going backwards to the root. Each node is the range in the suffix array where the

The suffix array is found by sorting the cyclic transformation lexicographically and taking their original indices. Range in the suffix array can be found by the R_ and R-

You could leave a comment if you were logged in.

lecture_notes/04-22-2011.1307551706.txt.gz · Last modified: 2011/06/08 09:48 by eyliaw