This shows you the differences between two versions of the page.
Both sides previous 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:46] eyliaw [Burrows Wheeler Transform] |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Burrows Wheeler Transform ====== | ====== Burrows Wheeler Transform ====== | ||
- | Incomplete. | + | The Burrows Wheeler Transform can be used to compress a suffix array, and is used in bioinformatic_tools:bwa. |
===== 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 |