Maximum parsimony xor haplotyping by sparse dictionary selection.
BACKGROUND
Xor-genotype is a cost-effective alternative to the genotype sequence of an individual. Recent methods developed for haplotype inference have aimed at finding the solution based on xor-genotype data. Given the xor-genotypes of a group of unrelated individuals, it is possible to infer the haplotype pairs for each individual with the aid of a small number of regular genotypes.


RESULTS
We propose a framework of maximum parsimony inference of haplotypes based on the search of a sparse dictionary, and we present a greedy method that can effectively infer the haplotype pairs given a set of xor-genotypes augmented by a small number of regular genotypes. We test the performance of the proposed approach on synthetic data sets with different number of individuals and SNPs, and compare the performances with the state-of-the-art xor-haplotyping methods PPXH and XOR-HAPLOGEN.


CONCLUSIONS
Experimental results show good inference qualities for the proposed method under all circumstances, especially on large data sets. Results on a real database, CFTR, also demonstrate significantly better performance. The proposed algorithm is also capable of finding accurate solutions with missing data and/or typing errors.
Department of Electrical Engineering, Columbia University, 500 W 120th St, New York, 10027 NY, USA. wangx@ee.columbia.edu.
Abdulkadir
A
Elmas
Guido H
GH
Jajamovich
Xiaodong
X
Wang
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D006239:Haplotypes; D006801:Humans; D008957:Models, Genetic; D020641:Polymorphism, Single Nucleotide