title: Fast Sampling-Based Whole-Genome Haplotype Block Recognition.
abstract: Scaling linkage disequilibrium (LD) based haplotype block recognition to the entire human genome has always been a challenge. The best-known algorithm has quadratic runtime complexity and, even when sophisticated search space pruning is applied, still requires several days of computations. Here, we propose a novel sampling-based algorithm, called S-MIG (++), where the main idea is to estimate the area that most likely contains all haplotype blocks by sampling a very small number of SNP pairs. A subsequent refinement step computes the exact blocks by considering only the SNP pairs within the estimated area. This approach significantly reduces the number of computed LD statistics, making the recognition of haplotype blocks very fast. We theoretically and empirically prove that the area containing all haplotype blocks can be estimated with a very high degree of certainty. Through experiments on the 243,080 SNPs on chromosome 20 from the 1,000 Genomes Project, we compared our previous algorithm MIG (++) with the new S-MIG (++) and observed a runtime reduction from 2.8 weeks to 34.8 hours. In a parallelized version of the S-MIG (++) algorithm using 32 parallel processes, the runtime was further reduced to 5.1 hours.
authors.forename: Daniel
authors.initials: D
authors.lastname: Taliun
authors.forename: Johann
authors.initials: J
authors.lastname: Gamper
authors.forename: Ulf
authors.initials: U
authors.lastname: Leser
authors.forename: Cristian
authors.initials: C
authors.lastname: Pattaro
mesh_terms: D000465:Algorithms; D015894:Genome, Human; D023281:Genomics / Q000379:methods*; D006239:Haplotypes / Q000235:genetics*; D006801:Humans; D015810:Linkage Disequilibrium / Q000235:genetics*; D008957:Models, Genetic; D010363:Pattern Recognition, Automated; D020641:Polymorphism, Single Nucleotide / Q000235:genetics*