Propagating the nVector Constraint : Haplotype Inference using Constraint Programming
Peter Backeman · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2013
Genetics research is a wide field and needs computer aid in many different areas. One such problem is the haplotype inference problem by pure parsimony (HIPP). In this thesis the HIPP problem is attacked with a constraint programming (CP) model based on the nVector constraint, for which a new propagator is designed. The results show that the current state-of-the-art model based on SAT-solvers are in general the most efficient, but that the CP approach in some cases finds a better solution when time is limited.