Skip to main content

Table 1 The information we compute for our example, \(T = \mathtt{GATTACAT!GATACAT!GATTAGATA}\)

From: Prefix-free parsing for building big BWTs

Rank

Mapped characters

Suffix

Sources

Frequency

Preceding partial sum

0

A

#GATTAC

1

1

0

1

T

!GATAC

2

1

1

2

T

!GATTAG

3

1

2

3

T

A$$

5

1

3

4

T

ACAT!

4

2

4

5

T

AGATA$$

5

1

6

6

C

AT!

4

2

7

7

G

ATA$$

5

1

9

8

G

ATAC

2

1

10

9

G

ATTAC

1

1

11

10

G

ATTAG

3

1

12

11

A

CAT#

4

2

13

12

A

GATA$$

5

1

15

13

!

GATAC

2

1

16

14

$

GATTAC

1

1

17

15

!

GATTAG

3

1

18

16

A

T!GATAC

2

1

19

17

A

T!GATTAG

3

1

20

18

A

TA$$

5

1

21

19

T, A

TAC

1; 2

2

22

20

T

TAG

3

1

24

21

A

TTAC

1

1

25

22

A

TTAG

3

1

26

  1. Each line shows the lexicographic rank r of an element \(s \in S\); the characters mapped to r by \(\beta\); s itself; the elements of D from which the mapped characters originate; the total frequency with which characters are mapped to r; and the preceding partial sum of the frequencies