title: Joint haplotype assembly and genotype calling via sequential Monte Carlo algorithm.
abstract: BACKGROUND
  Genetic variations predispose individuals to hereditary diseases, play important role in the development of complex diseases, and impact drug metabolism. The full information about the DNA variations in the genome of an individual is given by haplotypes, the ordered lists of single nucleotide polymorphisms (SNPs) located on chromosomes. Affordable high-throughput DNA sequencing technologies enable routine acquisition of data needed for the assembly of single individual haplotypes. However, state-of-the-art high-throughput sequencing platforms generate data that is erroneous, which induces uncertainty in the SNP and genotype calling procedures and, ultimately, adversely affect the accuracy of haplotyping. When inferring haplotype phase information, the vast majority of the existing techniques for haplotype assembly assume that the genotype information is correct. This motivates the development of methods capable of joint genotype calling and haplotype assembly.
  
  
  RESULTS
  We present a haplotype assembly algorithm, ParticleHap, that relies on a probabilistic description of the sequencing data to jointly infer genotypes and assemble the most likely haplotypes. Our method employs a deterministic sequential Monte Carlo algorithm that associates single nucleotide polymorphisms with haplotypes by exhaustively exploring all possible extensions of the partial haplotypes. The algorithm relies on genotype likelihoods rather than on often erroneously called genotypes, thus ensuring a more accurate assembly of the haplotypes. Results on both the 1000 Genomes Project experimental data as well as simulation studies demonstrate that the proposed approach enables highly accurate solutions to the haplotype assembly problem while being computationally efficient and scalable, generally outperforming existing methods in terms of both accuracy and speed.
  
  
  CONCLUSIONS
  The developed probabilistic framework and sequential Monte Carlo algorithm enable joint haplotype assembly and genotyping in a computationally efficient manner. Our results demonstrate fast and highly accurate haplotype assembly aided by the re-examination of erroneously called genotypes. A C code implementation of ParticleHap will be available for download from https://sites.google.com/site/asynoeun/particlehap.
authors.affiliation: Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, 78712, Texas, USA. soyeon.ahn@utexas.edu.
authors.forename: Soyeon
authors.initials: S
authors.lastname: Ahn
authors.affiliation: Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, 78712, Texas, USA. hvikalo@ece.utexas.edu.
authors.forename: Haris
authors.initials: H
authors.lastname: Vikalo
mesh_terms: D000465:Algorithms; D000818:Animals; D016678:Genome; D005838:Genotype; D006239:Haplotypes; D059014:High-Throughput Nucleotide Sequencing; D006801:Humans; D020407:Internet; D009010:Monte Carlo Method; D020641:Polymorphism, Single Nucleotide; D017422:Sequence Analysis, DNA / Q000379:methods*; D014584:User-Computer Interface