Whole-genome association studies present many new statistical and computational challenges due to the large quantity of data obtained. One of these challenges is haplotype inference; methods for haplotype inference designed for small data sets from candidate-gene studies do not scale well to the large number of individuals genotyped in whole-genome association studies. We present a new method and software for inference of haplotype phase and missing data that can accurately phase data from whole-genome association studies, and we present the first comparison of haplotype-inference methods for real and simulated data sets with thousands of genotyped individuals. We find that our method outperforms existing methods in terms of both speed and accuracy for large data sets with thousands of individuals and densely spaced genetic markers, and we use our method to phase a real data set of 3,002 individuals genotyped for 490,032 markers in 3.1 days of computing time, with 99% of masked alleles imputed correctly. Our method is implemented in the Beagle software package, which is freely available.

/pdf/rapid-and-accurate-haplotype-phasing-and-missing-data-hdxg8wd9k6.pdf

Rapid and accurate haplotype phasing and missing-data inference for whole-genome association studies by use of localized haplotype clustering.

Whole genome association studies are generating data sets with hundreds of thousands of markers genotyped on thousands of cases and controls. We show that whole genome haplotypic association testing with permutation to account for multiple testing is statistically powerful and computationally feasible on such data, using an efficient software implementation of a recently proposed method. We use realistic simulations to explore the statistical properties of the method, and show that for ungenotyped disease-susceptibility variants with population frequencies of 5% or less the haplotypic tests have markedly better power than single-marker tests. We propose a combined single-marker and haplotypic strategy, in which both single-marker and haplotypic tests are applied, with the minimum P-value adjusted for multiple testing by permutation which results in a test that is powerful for detecting both low-and high-frequency disease-susceptibility variants. Genet. Epidemiol. 2007. © 2007 Wiley-Liss, Inc.

https://onlinelibrary.wiley.com/doi/pdf/10.1002/gepi.20216

Efficient multilocus association testing for whole genome association studies using localized haplotype clustering.

Statistical imputation of classical HLA alleles in case-control studies has become established as a valuable tool for identifying and fine-mapping signals of disease association in the MHC. Imputation into diverse populations has, however, remained challenging, mainly because of the additional haplotypic heterogeneity introduced by combining reference panels of different sources. We present an HLA type imputation model, HLA*IMP:02, designed to operate on a multi-population reference panel. HLA*IMP:02 is based on a graphical representation of haplotype structure. We present a probabilistic algorithm to build such models for the HLA region, accommodating genotyping error, haplotypic heterogeneity and the need for maximum accuracy at the HLA loci, generalizing the work of Browning and Browning (2007) and Ron et al. (1998). HLA*IMP:02 achieves an average 4-digit imputation accuracy on diverse European panels of 97% (call rate 97%). On non-European samples, 2-digit performance is over 90% for most loci and ethnicities where data available. HLA*IMP:02 supports imputation of HLA-DPB1 and HLA-DRB3-5, is highly tolerant of missing data in the imputation panel and works on standard genotype data from popular genotyping chips. It is publicly available in source code and as a user-friendly web service framework.

/pdf/multi-population-classical-hla-type-imputation-3tvxdx2ghy.pdf

Multi-Population Classical HLA Type Imputation

In this paper, we study the problem of learning phylogenies and hidden Markov models. We call a Markov model nonsingular if all transition matrices have determinants bounded away from 0 (and 1). We highlight the role of the nonsingularity condition for the learning problem. Learning hidden Markov models without the nonsingularity condition is at least as hard as learning parity with noise. On the other hand, we give a polynomial-time algorithm for learning nonsingular phylogenies and hidden Markov models.

/pdf/learning-nonsingular-phylogenies-and-hidden-markov-models-2m7cj6yt0y.pdf

Learning nonsingular phylogenies and hidden Markov models

I propose a new method for association-based gene mapping that makes powerful use of multilocus data, is computationally efficient, and is straightforward to apply over large genomic regions. The approach is based on the fitting of variable-length Markov chain models, which automatically adapt to the degree of linkage disequilibrium (LD) between markers to create a parsimonious model for the LD structure. Edges of the fitted graph are tested for association with trait status. This approach can be thought of as haplotype testing with sophisticated windowing that accounts for extent of LD to reduce degrees of freedom and number of tests while maximizing information. I present analyses of two published data sets that show that this approach can have better power than single-marker tests or sliding-window haplotypic tests.

SingerYoram

Papers

On the Learnability and Usage of Acyclic Probabilistic Finite Automata