id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_sez4tbvmsnazjc6uvf5fqvutky	Tatiana Rocher	Indexing labeled sequences	2018	14	.pdf	application/pdf	7669	1205	76	the text in a Burrows–Wheeler transform (BWT) and a compressed label sequence in The label sequence is taken in the order of the text (TL-index) or Results: These indexes allow efficient text–label queries to count and find labeled The TLBW-index has an overhead on simple label queries but is very efficient to index the text, a bit vector BA marking the positions in the text where the labels change, and a WT WA indexing a compressed label sequence (Fig. 2A). Figure 2 TLand TLBW-indexes store a text of length 21 with four unique labels. Given a labeled text (T, A), the TLBW-index is defined as (U, BD, WD) (Fig. 2B). TLBW-index, we look for the label of all the pattern's letters. Table 2 Size, build and query times of three indexes indexing labeled texts, on three simulated files and on a genomic DNA sequence file with	./cache/work_sez4tbvmsnazjc6uvf5fqvutky.pdf	./txt/work_sez4tbvmsnazjc6uvf5fqvutky.txt