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 | Previous revision Next revision Both sides next revision | ||
|
lecture_notes:04-22-2011 [2011/06/08 17:11] eyliaw [Suffix array] |
lecture_notes:04-22-2011 [2011/06/08 17:14] eyliaw [Suffix array] |
||
|---|---|---|---|
| Line 21: | Line 21: | ||
| 6 $GOOGOL | 6 $GOOGOL | ||
| Sort: | Sort: | ||
| - | 6 $GOOGOL | + | 6 $GOOGO**L** |
| - | 3 GOL$GOO | + | 3 GOL$GO**O** |
| - | 0 GOOGOL$ | + | 0 GOOGOL**$** |
| - | 5 L$GOOGO | + | 5 L$GOOG**O** |
| - | 2 OGOL$GO | + | 2 OGOL$G**O** |
| - | 4 OL$GOOG | + | 4 OL$GOO**G** |
| - | 1 OOGOL$G | + | 1 OOGOL$**G** |
| + | |||
| + | S(i) = [6,3,0,5,2,4,1] | ||
| + | The Burrows Wheeler transform takes the last character of the sorted cyclic strings: | ||
| + | B(i) = LO$OOGG | ||
| - | S = [6,3,0,5,2,4,1] | ||
| - | The Burrows Wheeler transform takes the last column of 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
