Grouping preprocess to accurately extend application of EM algorithm to haplotype inference

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Haplotype inference is an indispensable technique in medical science, especially in genome-wide association studies. Although the conventional method of inference using the expectation-maximization (EM) algorithm by Excoffier and Slatkin is one standard approach, as its calculation cost is an exponential function of the maximum number of heterozygous loci, it has not been widely applied. We propose a method of haplotype inference that can empirically accommodate up to several tens of single nucleotide polymorphism loci in a single haplotype block while maintaining criteria that are exactly equivalent to those of the EM algorithm. The idea is to reduce the cost of calculating the EM algorithm by using a haplotype-grouping preprocess exploiting the symmetrical and inclusive relationships of haplotypes based on the Hardy-Weinberg equilibrium. Testing of the proposed method using real data sets revealed that it has a wider range of applications than the EM algorithm. © 2008 The Japan Society of Human Genetics and Springer.

Cite

CITATION STYLE

APA

Shindo, H., Chigira, H., Tanaka, J., Kamatani, N., & Inoue, M. (2008). Grouping preprocess to accurately extend application of EM algorithm to haplotype inference. Journal of Human Genetics, 53(8), 747–756. https://doi.org/10.1007/s10038-008-0308-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free