Norri, Tuukka
[Verfasser:in];
Cazaux, Bastien
[Verfasser:in];
Kosolobov, Dmitry
[Verfasser:in];
Mäkinen, Veli
[Verfasser:in]
;
Tuukka Norri and Bastien Cazaux and Dmitry Kosolobov and Veli Mäkinen
[Mitwirkende:r]
Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
Given a threshold L and a set R = {R_1, ., R_m} of m strings (haplotype sequences), each having length n, the minimum segmentation problem for founder reconstruction is to partition [1,n] into set P of disjoint segments such that each segment [a,b] in P has length at least L and the number d(a,b)=|{R_i[a,b] : 1 <= i <= m}| of distinct substrings at segment [a,b] is minimized over [a,b] in P. The distinct substrings in the segments represent founder blocks that can be concatenated to form max{d(a,b) : [a,b] in P} founder sequences representing the original 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 input strings being aligned haplotype sequences of complete human chromosomes, with a goal of finding a representative set of references that can be indexed for read alignment and variant calling. We implemented the new algorithm and give some experimental evidence on the practicality of the approach on this pan-genomic setting.