Models and Algorithms for Haplotyping Problem

Title: Models and Algorithms for Haplotyping Problem

Volume: 1 Issue: 1

Author(s): Xiang-Sun Zhang, Rui-Sheng Wang, Ling-Yun Wu and Luonan Chen

Affiliation:

Keywords: Single nucleotide polymorphism (SNP), haplotype assembly, Minimum Fragment Removal (MFR), Hardy-Weinber equilibrium (HWE), Perfect Phylogeny Haplotyping

Abstract: One of the main topics in genomics is to determine the relevance of DNA variations with some genetic disease. Single nucleotide polymorphism (SNP) is the most frequent and important form of genetic variation which involves a single DNA base. The values of a set of SNPs on a particular chromosome copy define a haplotype. Because of its importance in the studies of complex disease association, haplotyping is one of the central problems in bioinformatics. There are two classes of in silico haplotyping problems, i.e., single individual haplotyping and population haplotyping. In this review paper, we give an overview on the existing models and algorithms on this topic, report the recent progresses from the computational viewpoint and further discuss the future research trends.

Cite this article as:

Zhang Xiang-Sun, Wang Rui-Sheng, Wu Ling-Yun and Chen Luonan, Models and Algorithms for Haplotyping Problem, Current Bioinformatics 2006; 1 (1) . https://dx.doi.org/10.2174/157489306775330570