On the combinatorics of suffix arrays

Gregory Kucherov (1) , Lilla Tóthmérész (1) , Stéphane Vialette (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

We present a bijective characterization of suffix array permutations obtained from a characterization of Burrows-Wheeler arrays given in [1]. We show that previous characterizations [2], [3] and [4], or their analogs, can be obtained in a simple and elegant way using this relationship. To demonstrate the usefulness of our approach, we obtain simpler proofs for some known enumeration results about suffix arrays [3]. Our characterization of suffix arrays is the first based on their relationship with Burrows-Wheeler permutations.

Mots clés: combinatorics; permutations; suffix array; Burrows-Wheeler transform

Domaines: Algorithme et structure de données [cs.DS]

Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette. On the combinatorics of suffix arrays. Information Processing Letters, 2013, 113 (22-24), pp.915-920. ⟨10.1016/j.ipl.2013.09.009⟩. ⟨hal-00864634⟩