On the combinatorics of suffix arrays

DOI10.1016/j.ipl.2013.09.009zbMath1284.68486arXiv1206.3877OpenAlexW1994106054WikidataQ58064476 ScholiaQ58064476MaRDI QIDQ2445335

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

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.3877

zbMATH Keywords

permutationscombinatorial problemsBurrows-Wheeler transformsuffix array

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (7)

r-indexing the eBWT ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ Recognizing union-find trees is NP-complete ⋮ When a dollar makes a BWT ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ A suffix tree or not a suffix tree? ⋮ String inference from longest-common-prefix array

Cites Work

• Unnamed Item
• Unnamed Item
• A quick tour on suffix arrays and compressed suffix arrays
• Counting suffix arrays and strings
• Counting permutations with given cycle structure and descent set
• A note on the Burrows-Wheeler transformation
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Mathematical Foundations of Computer Science 2003
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

This page was built for publication: On the combinatorics of suffix arrays