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

• Type: Journal
• Year: 2005
• Where: CANDC
• Authors: Yu-Ying Zhao, Ling-Yun Wu, Ji-Hong Zhang, Rui-Sheng Wang, Xiang-Sun Zhang
• Keywords: CANDC 2005, Emerging Technology, General Wmlf Model, Haplotype Assembly Problem, Weighted Minimum Letter