Haplotype assembly from aligned weighted SNP fragments
Given an assembled genome of a diploid organism the haplotype assembly problem can be
formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments.
Known computational formulations (models) of this problem are minimum letter flips (MLF)
and the weighted minimum letter flips (WMLF; Greenberg et al.(INFORMS J. Comput. 2004,
14, 211–213)). In this paper we show that the general WMLF model is NP-hard even for the
gapless case. However the algorithmic solutions for selected variants of WMFL can exist and …
formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments.
Known computational formulations (models) of this problem are minimum letter flips (MLF)
and the weighted minimum letter flips (WMLF; Greenberg et al.(INFORMS J. Comput. 2004,
14, 211–213)). In this paper we show that the general WMLF model is NP-hard even for the
gapless case. However the algorithmic solutions for selected variants of WMFL can exist and …
Showing the best result for this search. See all results