Haplotype assembly is the problem of reconstructing the two parental chromosomes of an individual from a set of sampled dna-sequences. A combinatorial optimization problem that models haplotype assembly is the minimum error correction problem (mec). This problem has been intensively studied in the computational biology literature and is also known in the clustering literature: essentially we are required to find two cluster centres such that the sum of distances to the nearest centre, is minimized. We introduce here the problem fixed haplotype-minimum error correction (fh-mec), a new variant of mec which corresponds to instances where one of the haplotypes/centres is already given. We provide hardness results for the problem on various restricted instances. We also propose a new and very simple 2-approximation algorithm for mec on binary input matrices.
|Title of host publication||Computing and Combinatorics. COCOON 2018|
|Editors||L. Wang, D. Zhu|
|Publication status||Published - 29 Jun 2018|
|Series||Lecture Notes in Computer Science|
Goblet, A., Kelk, S., Mihalák, M., & Stamoulis, G. (2018). On a Fixed Haplotype Variant of the Minimum Error Correction Problem. In L. Wang, & D. Zhu (Eds.), Computing and Combinatorics. COCOON 2018 (pp. 554-566). Springer Verlag. Lecture Notes in Computer Science, Vol.. 10976 https://doi.org/10.1007/978-3-319-94776-1_46