Change search
ReferencesLink to record
Permanent link

Direct link
Propagating the nVector Constraint: Haplotype Inference using Constraint Programming
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2013 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

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.

Place, publisher, year, edition, pages
IT, 13 056
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-211862OAI: diva2:669008
Educational program
Master Programme in Computer Science
Available from: 2013-12-02 Created: 2013-12-02 Last updated: 2013-12-02Bibliographically approved

Open Access in DiVA

fulltext(675 kB)105 downloads
File information
File name FULLTEXT01.pdfFile size 675 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 105 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 373 hits
ReferencesLink to record
Permanent link

Direct link