The phasing of heterozygous traits: Algorithms and complexity

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 terna...

Full description

Saved in:
Bibliographic Details
Published inComputers & mathematics with applications (1987) Vol. 55; no. 5; pp. 960 - 969
Main Author Lancia, Giuseppe
Format Journal Article
LanguageEnglish
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
Online AccessGet full text

Cover

More Information
Summary: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 ) .
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2006.12.089