Name
Title | ||
|---|---|---|
Hap-seq: an optimal algorithm for haplotype phasing with imputation using sequencing data. |
Abstract | ||
|---|---|---|
Inference of haplotypes, or the sequence of alleles along each chromosome, is a fundamental problem in genetics and is important for many analyses, including admixture mapping, identifying regions of identity by descent, and imputation. Traditionally, haplotypes are inferred from genotype data obtained from microarrays using information on population haplotype frequencies inferred from either a large sample of genotyped individuals or a reference dataset such as the HapMap. Since the availability of large reference datasets, modern approaches for haplotype phasing along these lines are closely related to imputation methods. When applied to data obtained from sequencing studies, a straightforward way to obtain haplotypes is to first infer genotypes from the sequence data and then apply an imputation method. However, this approach does not take into account that alleles on the same sequence read originate from the same chromosome. Haplotype assembly approaches take advantage of this insight and predict haplotypes by assigning the reads to chromosomes in such a way that minimizes the number of conflicts between the reads and the predicted haplotypes. Unfortunately, assembly approaches require very high sequencing coverage and are usually not able to fully reconstruct the haplotypes. In this work, we present a novel approach, Hap-seq, which is simultaneously an imputation and assembly method that combines information from a reference dataset with the information from the reads using a likelihood framework. Our method applies a dynamic programming algorithm to identify the predicted haplotype, which maximizes the joint likelihood of the haplotype with respect to the reference dataset and the haplotype with respect to the observed reads. We show that our method requires only low sequencing coverage and can reconstruct haplotypes containing both common and rare alleles with higher accuracy compared to the state-of-the-art imputation methods. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1089/cmb.2012.0091 | Journal of Computational Biology |
Keywords | DocType | Volume |
assembly approach,population haplotype,large reference datasets,haplotype assembly approach,state-of-the-art imputation method,assembly method,high sequencing coverage,reference dataset,sequencing data,optimal algorithm,imputation method,genotype data,hidden markov model,dynamic programming,imputation,genetic variation | Journal | 20 |
Issue | ISSN | Citations |
2 | 1557-8666 | 8 |
PageRank | References | Authors |
0.89 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan He | 1 | 133 | 12.54 |
| Buhm Han | 2 | 50 | 8.89 |
| Eleazar Eskin | 3 | 1790 | 170.53 |