Tailoring r-index for metagenomics

06/10/2020
by   Dustin Cobas, et al.
0

A basic problem in metagenomics is to assign a sequenced read to the correct species in the reference collection. In typical applications in genomic epidemiology and viral metagenomics the reference collection consists of set of species with each species represented by its highly similar strains. It has been recently shown that accurate read assignment can be achieved with k-mer hashing-based pseudoalignment: A read is assigned to species A if each of its k-mer hits to reference collection is located only on strains of A. We study the underlying primitives required in pseudoalignment and related tasks. We propose three space-efficient solutions building upon the document listing with frequencies problem. All the solutions use an r-index (Gagie et al., SODA 2018) as an underlying index structure for the text obtained as concatenation of the set of species, as well as for each species. Given t species whose concatenation length is n, and whose Burrows-Wheeler transform contains r runs, our first solution, based on a grammar-compressed document array with precomputed queries at non terminal symbols, reports the frequencies for the ndoc distinct documents in which the pattern of length m occurs in O(m + log(n) ndoc) time. Our second solution is also based on a grammar-compressed document array, but enhanced with bitvectors and reports the frequencies in O(m + ((t/w)log n + log(n/r)) ndoc) time, over a machine with wordsize w. Our third solution, based on the interleaved LCP array, answers the same query in O(m + log(n/r) ndoc). We implemented our solutions and tested them on real-world and synthetic datasets. The results show that all the solutions are fast on highly-repetitive data, and the size overhead introduced by the indexes are comparable with the size of the r-index.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2021

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

The suffix array, describing the lexicographic order of suffixes of a gi...
research
02/20/2019

Fast, Small, and Simple Document Listing on Repetitive Text Collections

Document listing on string collections is the task of finding all docume...
research
11/16/2018

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment

While short read aligners, which predominantly use the FM-index, are abl...
research
11/24/2022

A fast and simple O (z log n)-space index for finding approximately longest common substrings

We describe how, given a text T [1..n] and a positive constant ϵ, we can...
research
05/28/2021

Grammar Index By Induced Suffix Sorting

Pattern matching is the most central task for text indices. Most recent ...
research
10/04/2021

FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns

The run-length compressed Burrows-Wheeler transform (RLBWT) used in conj...

Please sign up or login with your details

Forgot password? Click here to reset