User Tools

Site Tools


This is an old revision of the document!

Burrows Wheeler Aligner

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

The prefix trie

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 that prefix may be found. Each edge is a character in the prefix. A string can be found–allowing for mismatches and gaps–in the prefix tree by going up each branch and comparing characters to the prefix until the all characters have been matched or the mismatch limit is met.

Suffix array

The suffix array is found by sorting the cyclic transformation lexicographically and taking their original indices.

You could leave a comment if you were logged in.
lecture_notes/04-22-2011.1307552488.txt.gz · Last modified: 2011/06/08 10:01 by eyliaw