HapTree: A Novel Bayesian Framework for Single Individual Polyplotyping Using NGS Data

  • Emily Berger
  • Deniz Yorukoglu
  • Jian Peng
  • Bonnie Berger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8394)

Abstract

Using standard genotype calling tools, it is possible to accurately identify the number of “wild type” and “mutant” alleles (A, C, G, or T) for each singlenucleotide polymorphism (SNP) site. In the case of two heterozygous SNP sites however, genotype calling tools cannot determine whether “mutant” alleles from different SNP loci are on the same or different chromosomes. While in many cases the former would be healthy, the latter can cause loss of function; it is therefore important to identify the phase—the copies of a chromosome on which the mutant alleles occur—in addition to the genotype. This need necessitates efficient algorithms to obtain an accurate and comprehensive haplotype reconstruction (the phase of heterozygous SNPs in the genome) directly from the next-generation sequencing (NGS) read data. Nearly all previous haplotype reconstruction studies have focused on diploid genomes and are rarely scalable to genomes of higher ploidy; however, computational investigations into polyploid genomes carry great importance, impacting plant, yeast and fish genomics, as well as studies into the evolution of modern-day eukaryotes and (epi)genetic interactions between copies of genes.

References

  1. 1.
    Aguiar, D., Istrail, S.: Hapcompass: a fast cycle basis algorithm for accurate haplotype assembly of sequence data. Journal of Computational Biology 19(6), 577–590 (2012)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Aguiar, D., Istrail, S.: Haplotype assembly in polyploid genomes and identical by descent shared tracts. Bioinformatics 29(13), i352–i360 (2013)Google Scholar
  3. 3.
    Bansal, V., Bafna, V.: Hapcut: an efficient and accurate algorithm for the haplotype assembly problem. Bioinformatics 24(16), i153–i159 (2008)Google Scholar
  4. 4.
    Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs problems, complexity, and algorithms. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 182–193. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Lippert, R., Schwartz, R., Lancia, G., Istrail, S.: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics 3(1), 23–31 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Emily Berger
    • 1
    • 2
    • 3
  • Deniz Yorukoglu
    • 2
  • Jian Peng
    • 1
    • 2
  • Bonnie Berger
    • 1
    • 2
  1. 1.Department of MathematicsMITCambridgeUSA
  2. 2.Computer Science & Artificial Intelligence LaboratoryMITCambridgeUSA
  3. 3.Department of MathematicsUC BerkeleyBerkeleyUSA

Personalised recommendations