This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
lecture_notes:04-22-2011 [2011/04/25 22:01] eyliaw |
lecture_notes:04-22-2011 [2011/06/08 16:48] eyliaw [Burrows Wheeler Transform] |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Burrows Wheeler Transform ====== | + | ====== Burrows Wheeler aligner ====== |
- | Incomplete. | + | We discussed the [[bioinformatic_tools:bwa]]. It uses the Burrows Wheeler Transform to represent a prefix trie, allowing for short read alignment. |
===== The prefix trie ====== | ===== 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 the | 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 |