lecture_notes:04-22-2011
This is an old revision of the document!
Table of Contents
Burrows Wheeler Transform
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 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
Suffix array
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.1307551590.txt.gz · Last modified: 2011/06/08 09:46 by eyliaw
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
