On the combinatorics of suffix arrays

Authors:
Gregory Kucherov;Lilla Tóthmérész;Stéphane Vialette
Affiliations:
Université Paris-Est & CNRS, Laboratoire dInformatique Gaspard Monge, Marne-la-Valléée, France;Université Paris-Est & CNRS, Laboratoire dInformatique Gaspard Monge, Marne-la-Valléée, France and Eötvös University, Pázmány Péter sétány 1/C, H- ...;Université Paris-Est & CNRS, Laboratoire dInformatique Gaspard Monge, Marne-la-Valléée, France
Venue:
Information Processing Letters
Year:
2013

Citing 12
Cited 0

New indices for text: PAT Trees and PAT arrays

Information retrieval
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Counting permutations with given cycle structure and descent set

Journal of Combinatorial Theory Series A
A categorization theorem on suffix arrays with applications to space efficient text indexes

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

SIAM Journal on Computing
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
Compressed full-text indexes

ACM Computing Surveys (CSUR)
Counting suffix arrays and strings

Theoretical Computer Science
Linear-time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A quick tour on suffix arrays and compressed suffix arrays

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

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-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.