Indexing labeled sequences - Archive ouverte HAL Access content directly
Journal Articles PeerJ Computer Science Year : 2018

Indexing labeled sequences


Background: Labels are a way to add some information on a text, such as functional annotations such as genes on a DNA sequences. V(D)J recombinations are DNA recombinations involving two or three short genes in lymphocytes. Sequencing this short region (500 bp or less) produces labeled sequences and brings insight in the lymphocyte repertoire for onco-hematology or immunology studies. Methods: We present two indexes for a text with non-overlapping labels. They store the text in a Burrows–Wheeler transform (BWT) and a compressed label sequence in a Wavelet Tree. The label sequence is taken in the order of the text (TL-index) or in the order of the BWT (TL-BW-index). Both indexes need a space related to the entropy of the labeled text. Results: These indexes allow efficient text–label queries to count and find labeled patterns. The TL-BW-index has an overhead on simple label queries but is very efficient on combined pattern–label queries. We implemented the indexes in C++ and compared them against a baseline solution on pseudo-random as well as on V(D)J labeled texts. Discussion: New indexes such as the ones we proposed improve the way we index and query labeled texts as, for instance, lymphocyte repertoire for hematological and immunological studies.
Fichier principal
Vignette du fichier
2018-Rocher-indexing-labeled-sequences.pdf (1.4 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01743104 , version 1 (26-03-2018)



Tatiana Rocher, Mathieu Giraud, Mikaël Salson. Indexing labeled sequences. PeerJ Computer Science, 2018, 4, pp.1-14. ⟨10.7717/peerj-cs.148⟩. ⟨hal-01743104⟩
176 View
62 Download



Gmail Facebook X LinkedIn More