arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1009.3984cs.DScs.CE
收藏

用于下一代DNA程序集的精确匹配重叠图高效数据结构

A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly

Hieu Dinh, Sanguthevar Rajasekaran

摘要:

给定长度为$\ell$的字符串的精确匹配重叠图是边加权图,其中每个顶点与字符串相关联,并且存在权重为$ω= \ell - |ov_{max}(x,y)|$的边$(x,y)$当且仅当$ω\leq λ$,其中$|ov_{max}(x,y)|$是$ov_{max}(x,y)$的长度,$λ$是给定的阈值。在本文中,我们表明,完全匹配的重叠图可以表示为一个紧凑的数据结构,可以存储使用最多$(2λ-1 )(2\lceil\log n\rceil + \lceil\logλ\rceil)n$位,保证访问边缘的基本操作需要$O(\log λ)$时间。精确匹配重叠图已广泛用于DNA组装和\emph{shortest super string problem}的上下文中,其中串$n$的数量范围从几千到几十亿,串的长度$\ell$从25到1000,这取决于DNA测序技术。然而,许多使用重叠图的DNA组装器面临着构建和存储重叠图的主要问题。特别是,这些DNA组装器不可能处理下一代测序技术产生的大量数据,其中字符串$n$的数量通常非常大,从数亿到几十亿不等。事实上,据我们所知,没有DNA组装器可以处理如此大量的字符串。幸运的是,我们的紧凑的数据结构,构造和存储重叠图的主要问题实际上得到了解决,因为它只需要线性时间和线性内存。因此,它打开了构建一个可以有效处理大规模数据集的DNA组装器的可能性之门。

英文摘要:

An exact-match overlap graph of $n$ given strings of length $\ell$ is an edge-weighted graph in which each vertex is associated with a string and there is an edge $(x,y)$ of weight $ω= \ell - |ov_{max}(x,y)|$ if and only if $ω\leq λ$, where $|ov_{max}(x,y)|$ is the length of $ov_{max}(x,y)$ and $λ$ is a given threshold. In this paper, we show that the exact-match overlap graphs can be represented by a compact data structure that can be stored using at most $(2λ-1 )(2\lceil\log n\rceil + \lceil\logλ\rceil)n$ bits with a guarantee that the basic operation of accessing an edge takes $O(\log λ)$ time. Exact-match overlap graphs have been broadly used in the context of DNA assembly and the \emph{shortest super string problem} where the number of strings $n$ ranges from a couple of thousands to a couple of billions, the length $\ell$ of the strings is from 25 to 1000, depending on DNA sequencing technologies. However, many DNA assemblers using overlap graphs are facing a major problem of constructing and storing them. Especially, it is impossible for these DNA assemblers to handle the huge amount of data produced by the next generation sequencing technologies where the number of strings $n$ is usually very large ranging from hundred million to a couple of billions. In fact, to our best knowledge there is no DNA assemblers that can handle such a large number of strings. Fortunately, with our compact data structure, the major problem of constructing and storing overlap graphs is practically solved since it only requires linear time and and linear memory. As a result, it opens the door of possibilities to build a DNA assembler that can handle large-scale datasets efficiently.

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

↑