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

线性时间内泛基因组创始人重建的最小分割算法

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time

Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mäkinen

摘要:

给定阈值$L$和$m$单倍型序列的集合$\mathcal{R} = \{R_1, \ldots, R_m\}$,每个具有长度$n$,用于建立者重建的最小分割问题是将序列划分成不相交的片段$\mathcal{R}[i_1{+}1,i_2], \mathcal{R}[i_2{+}1, i_3], \ldots, \mathcal{R}[i_{r-1}{+}1, i_r]$,其中$0 = i_1 < \cdots < i_r = n$和$\mathcal{R}[i_{j-1}{+}1, i_j]$是集合$\{R_1[i_{j-1}{+}1, i_j], \ldots, R_m[i_{j-1}{+}1, i_j]\}$,使得每个片段的长度$i_j - i_{j-1}$至少为$L$,并且$K = \max_j\{ |\mathcal{R}[i_{j-1}{+}1, i_j]| \}$被最小化。片段$\mathcal{R}[i_{j-1}{+}1, i_j]$中的不同子串表示可以连接以形成表示原始$\mathcal{R}$的$K$创始者序列的创始者块,使得交叉仅发生在片段边界处。我们给出了一个最优的$O(mn)$时间算法来解决这个问题,改进了早期的$O(mn^2)$。这种改进使得能够利用作为完整人类染色体的单倍型的泛基因组设置上的算法,目标是找到可以被索引用于读段比对和变体调用的代表性参考集合。

英文摘要:

Given a threshold $L$ and a set $\mathcal{R} = \{R_1, \ldots, R_m\}$ of $m$ haplotype sequences, each having length $n$, the minimum segmentation problem for founder reconstruction is to partition the sequences into disjoint segments $\mathcal{R}[i_1{+}1,i_2], \mathcal{R}[i_2{+}1, i_3], \ldots, \mathcal{R}[i_{r-1}{+}1, i_r]$, where $0 = i_1 < \cdots < i_r = n$ and $\mathcal{R}[i_{j-1}{+}1, i_j]$ is the set $\{R_1[i_{j-1}{+}1, i_j], \ldots, R_m[i_{j-1}{+}1, i_j]\}$, such that the length of each segment, $i_j - i_{j-1}$, is at least $L$ and $K = \max_j\{ |\mathcal{R}[i_{j-1}{+}1, i_j]| \}$ is minimized. The distinct substrings in the segments $\mathcal{R}[i_{j-1}{+}1, i_j]$ represent founder blocks that can be concatenated to form $K$ founder sequences representing the original $\mathcal{R}$ such that crossovers happen only at segment boundaries. We give an optimal $O(mn)$ time algorithm to solve the problem, improving over earlier $O(mn^2)$. This improvement enables to exploit the algorithm on a pan-genomic setting of haplotypes being complete human chromosomes, with a goal of finding a representative set of references that can be indexed for read alignment and variant calling.

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

↑