View publication
| Title | Improving Text Indexes Using Compressed Permutations |
| Authors | Jérémy Barbay, Carlos Bedregal, Gonzalo Navarro |
| Publication date | 2010 |
| Abstract | Any sorting algorithm in the comparison model defines an encoding scheme for permutations. As adaptive sorting algorithms perform o(n lg n) comparisons on restricted classes of permutations, each defines one or more compression schemes for permutations. In the case of the compression schemes inspired by Adaptive Merge Sort, a small amount of additional data allows to support in good time the access and reversed access to the compressed permutation, without decompressing it. In this paper we explore the application of two of these compressed succinct data-structures to the encoding of inverted lists and of suffix arrays, and show experimentally that they yield a practical self-index on practical data-sets, from natural language to biological data. |
| Downloaded | 6 times |
| Conference name | Jornadas Chilenas de Computación |
|