کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
471178 698603 2008 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The phasing of heterozygous traits: Algorithms and complexity
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
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 HH of binary vectors (called haplotypes  ) that explain a set of GG of ternary vectors (called genotypes  ). The number χ(G)χ(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)χ(G).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 55, Issue 5, March 2008, Pages 960–969
نویسندگان
,