@ARTICLE{Bagherian, author = {Etemadi, M. and Bagherian, M. and Vaziri, H. and }, title = {Two Binary Linear Programming Models for Haplotype Assembly Problem in Triploid Case}, volume = {18}, number = {3}, abstract ={The haplotype assembly problem aims at finding originate haplotypes of some fragments that obtained from sequencing methods. In diploid case in which organisms have pair chromosomes, like humans, the aim is to reconstruct two haplotypes such that each of reads is originated from one of the two reconstructed haplotypes. In diploid case, the problem is well studied and since it is NP-hard due to unavoidable errors of sequencing machines, exact approaches are of exponential order. So, many fast, but approximate approaches have been proposed. In triploid case, the aim is finding three haplotypes such that each read originates from one of the three haplotypes. The triploid case is much harder than the diploid case and faces with more computational difficulties. For this reason, a few researchers studied the triploid case of haplotype assembly problem. In this paper, two binary linear programming models are proposed for two cases of availability and non-availability of genotype data for triploid haplotype assembly and the computational efficiency of the models is tested on simulated datasets using AIMMS. The proposed models could be generalized to higher ploidy. }, URL = {http://jamlu.liau.ac.ir/article-1-1609-en.html}, eprint = {http://jamlu.liau.ac.ir/article-1-1609-en.pdf}, journal = {Journal of Operational Research and Its Applications}, doi = {10.52547/jamlu.18.3.1}, year = {2021} }