HyDA-Vista:序列组装中k-mer大小的最优引导选择
HyDA-Vista: Towards Optimal Guided Selection of k-mer Size for Sequence Assembly
摘要:
动机:与装配质量密切相关的是装配器构建的de Bruijn图的复杂性。因此,已经有许多范式被开发来降低de Bruijn图的复杂性。对此,一个明显的组合范例是允许$k$的值变化;在图更复杂的情况下具有较大的$k$值,并且在图可能包含更少的伪边和顶点的情况下具有较小的$k$值。影响该方法实用性的一个公开问题是如何在构建de Bruijn图之前预测$k$的值。我们表明,最佳值的$k$可以预测组装前,通过使用包含在一个遗传学上接近的基因组中的信息,因此,有助于利用多个值的$k$实用的基因组组装。结果如下:我们提出了HyDA-Vista,这是一个基因组组装程序,使用同源性信息来选择一个值的$k$为每个读取之前的de Bruijn图建设。如果没有测序错误并且覆盖度足够,则所选的$k$是最佳的。我们的方法的基础是{ \em最大序列景观}的构造,这是一个数据结构,它为输入字符串中的每个位置存储包含该位置的最大重复子串。特别地,我们证明了最大序列景观可以在$O(n + n \log n)$ -时间和$O(n)$ -空间中构造。HyDA-Vista首先构建了同源基因组的最大序列景观。然后将读段与该参考基因组比对,并使用最大序列景观和比对将$k$的值分配给每个读段。最后,通过迭代de Bruijn图构建方法组装所有读段。我们的结果和与其他汇编器的比较表明,HyDA-Vista实现了{ \em E.在重复解析或脚手架之前,
英文摘要:
Motivation: Intimately tied to assembly quality is the complexity of the de Bruijn graph built by the assembler. Thus, there have been many paradigms developed to decrease the complexity of the de Bruijn graph. One obvious combinatorial paradigm for this is to allow the value of $k$ to vary; having a larger value of $k$ where the graph is more complex and a smaller value of $k$ where the graph would likely contain fewer spurious edges and vertices. One open problem that affects the practicality of this method is how to predict the value of $k$ prior to building the de Bruijn graph. We show that optimal values of $k$ can be predicted prior to assembly by using the information contained in a phylogenetically-close genome and therefore, help make the use of multiple values of $k$ practical for genome assembly. Results: We present HyDA-Vista, which is a genome assembler that uses homology information to choose a value of $k$ for each read prior to the de Bruijn graph construction. The chosen $k$ is optimal if there are no sequencing errors and the coverage is sufficient. Fundamental to our method is the construction of the {\em maximal sequence landscape}, which is a data structure that stores for each position in the input string, the largest repeated substring containing that position. In particular, we show the maximal sequence landscape can be constructed in $O(n + n \log n)$-time and $O(n)$-space. HyDA-Vista first constructs the maximal sequence landscape for a homologous genome. The reads are then aligned to this reference genome, and values of $k$ are assigned to each read using the maximal sequence landscape and the alignments. Eventually, all the reads are assembled by an iterative de Bruijn graph construction method. Our results and comparison to other assemblers demonstrate that HyDA-Vista achieves the best assembly of {\em E. coli} before repeat resolution or scaffolding.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。