arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.7520cs.DSq-bio.GN
收藏

一种基于外存储器的串图构造算法

An External-Memory Algorithm for String Graph Construction

Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Marco Previtali, Raffaella Rizzi

摘要:

最近的一些结果已经引入了外部存储器算法来计算一组字符串的自索引,主要是通过计算输入字符串的Burrows-Wheeler变换(BWT)。这些结果的动机来自生物信息学,其中大量的短字符串(称为读取)被常规地产生和分析。在该领域中,一个基本问题是从未知基因组中提取的大量短得多的样本中组装基因组。目前用来解决这个问题的方法是内存密集型的。这一事实并不预示着基因组数据的可用性正在不断增加。在基因组组装中使用的数据结构是字符串图,其中顶点对应于样本,弧表示两个重叠的样本。在本文中,我们解决一个开放的问题:设计一个外部存储器算法来计算字符串图。

英文摘要:

Some recent results have introduced external-memory algorithms to compute self-indexes of a set of strings, mainly via computing the Burrows-Wheeler Transform (BWT) of the input strings. The motivations for those results stem from Bioinformatics, where a large number of short strings (called reads) are routinely produced and analyzed. In that field, a fundamental problem is to assemble a genome from a large set of much shorter samples extracted from the unknown genome. The approaches that are currently used to tackle this problem are memory-intensive. This fact does not bode well with the ongoing increase in the availability of genomic data. A data structure that is used in genome assembly is the string graph, where vertices correspond to samples and arcs represent two overlapping samples. In this paper we address an open problem: to design an external-memory algorithm to compute the string graph.

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

↑