arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.05871cs.DS
收藏

为宏基因组学定制r指数

Tailoring r-index for metagenomics

Dustin Cobas, Veli Mäkinen, Massimiliano Rossi

摘要:

宏基因组学中的一个基本问题是将测序读数分配给参考集合中的正确物种。在基因组流行病学和病毒宏基因组学的典型应用中,参考集合由一组物种组成,每个物种由其高度相似的菌株代表。最近已经表明,可以使用基于$k$ -mer散列的伪比对实现准确的读段分配:如果读段与参考集合的每个$k$ -mer命中仅位于A的菌株上,则将其分配给菌种A。我们研究了伪对齐和相关任务所需的基本原语。我们提出了三个空间有效的解决方案,建立在文件列表的频率问题。所有的解决方案都使用$r$索引(Gagie等人,SODA 2018)作为文本的底层索引结构,该文本作为物种集以及每个物种的串联获得。给定$t$物种的级联长度是$n$,其Burrows-Wheeler变换包含$r$运行,我们的第一个解决方案,基于语法压缩的文档数组与预先计算的查询在非终端符号,报告的频率为${\tt ndoc}$不同的文档中,长度$m$的模式发生在${\cal O}(m + \log(n){\tt ndoc}) $时间。我们的第二个解决方案也是基于一个语法压缩的文档数组,但增强了位向量和报告频率在${\cal O}(m + ((t/w)\log n + \log(n/r)){\tt ndoc})$的时间,在机器上的字大小$w$。我们的第三个解决方案基于交错LCP阵列,在${\cal O}(m + \log(n/r){\tt ndoc})$中回答相同的查询。我们实施了我们的解决方案,并在真实世界和合成数据集上进行了测试。结果表明,所有的解决方案都是快速的高重复数据,索引所引入的大小开销与$r$索引的大小相当。

英文摘要:

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 ${\tt ndoc}$ distinct documents in which the pattern of length $m$ occurs in ${\cal O}(m + \log(n){\tt ndoc}) $ time. Our second solution is also based on a grammar-compressed document array, but enhanced with bitvectors and reports the frequencies in ${\cal O}(m + ((t/w)\log n + \log(n/r)){\tt ndoc})$ time, over a machine with wordsize $w$. Our third solution, based on the interleaved LCP array, answers the same query in ${\cal O}(m + \log(n/r){\tt 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑