lecture_notes:04-22-2011
Differences
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/06/08 16:46] eyliaw [Burrows Wheeler Transform] |
lecture_notes:04-22-2011 [2011/06/08 16:48] eyliaw [Burrows Wheeler Transform] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Burrows Wheeler Transform ====== | + | ====== Burrows Wheeler aligner ====== |
| - | The Burrows Wheeler Transform can be used to compress a suffix array, and is used in [[bioinformatic_tools:bwa]]. | + | 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 | ||
lecture_notes/04-22-2011.txt · Last modified: 2015/08/09 23:06 by 212.129.31.47
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
