Table 1.
Partition A | Partition B | Partition C | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
S | a | b | a | b | a | a | a | b | b | a | b | b | b | a | b |
pos | 1 | 2 | 3 | 4 | 5 | 1 | 2 | 3 | 4 | 5 | 1 | 2 | 3 | 4 | 5 |
SA | 5 | 3 | 1 | 4 | 2 | 1 | 2 | 5 | 4 | 3 | 4 | 5 | 3 | 2 | 1 |
An example of partitions of size 5 for the input string S=ababaaabbabbbab. The first partition is ababa, followed by the tail aa, which does not occur within the partition. In the last row are the suffix arrays, SA, for each partition.