Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

Visa fullständig post



Permalänk

http://hdl.handle.net/10138/1200

Citation

In Proc. 15th Symposium on String Processing and Information Retrieval, LNCS 5280, pp. 164–175, 2008.

Titel: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
Författare: Siren, Jouni; Välimäki, Niko; Mäkinen, Veli; Navarro, Gonzalo
Utgivare: Springer-Verlag
Datum: 2008
Permanenta länken (URI): http://hdl.handle.net/10138/1200
Abstrakt: A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. This paper is devoted to studying ways to store massive sets of highly repetitive sequence collections in space-efficient manner so that retrieval of the content as well as queries on the content of the sequences can be provided time-efficiently. We show that the state-of-the-art entropy-bound full-text self-indexes do not yet provide satisfactory space bounds for this specific task. We engineer some new structures that use run-length encoding and give empirical evidence that these structures are superior to the current structures.


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
paper.pdf 173.7Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post