The phasing of heterozygous traits: Algorithms and complexity

• Published in: Computers & mathematics with applications (1987) Vol. 55; no. 5; pp. 960 - 969
• Main Author: Lancia, Giuseppe
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01-03-2008
• Subjects: Algorithms; Clark’s rule; Combinatorial analysis; Complexity; Computational biology; Mathematical analysis; Mathematical models; Perfect phylogeny haplotyping; Phasing; Pure parsimony haplotyping; Vectors (mathematics); Pure parsimony haplotyping; Perfect phylogeny haplotyping; Computational biology; Clark’s rule
• ISSN: 0898-1221; 1873-7668
• DOI: 10.1016/j.camwa.2006.12.089

Combinatorial haplotyping problems have received great attention in the past few years. We review their definitions and the main results that were obtained for their solution. Haplotyping problems require one to determine a set
H
of binary vectors (called
haplotypes) that explain a set of
G
of ternary vectors (called
genotypes). The number
χ
(
G
)
of haplotypes to choose from can be exponential with respect to the number of genotypes. We give an exact formula, based on the inclusion–exclusion principle, for determining
χ
(
G
)
.