Skip to main content

Table 1 Suffix array p k and auxiliary information, in this case the lcp and bwt arrays, for S = ACTAACTG.

From: On finding minimal absent words

k

p k

lcp k

bwt k

S[p k ..|S|]

1

4

0

T

AACTG

2

1

1

#

ACTAACTG

3

5

3

A

ACTG

4

2

0

A

CTAACTG

5

6

2

A

CTG

6

8

0

T

G

7

3

0

C

TAACTG

8

7

1

C

TG