Grouping preprocess to accurately extend application of EM algorithm to haplotype inference
Related Experiment Video
Updated: Jul 4, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
Hiroyuki Shindo1, Hiroshi Chigira1, Junji Tanaka2
1Department of Electrical Engineering and Bioscience, Waseda University, 3-4-1, Okubo, Shinjuku-ku, Tokyo, 1698555, Japan.
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.
