Haplotypes versus genotypes on pedigrees
- PMID: 21504603
- PMCID: PMC3102622
- DOI: 10.1186/1748-7188-6-10
Haplotypes versus genotypes on pedigrees
Abstract
Background: Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping. However, methods for pedigree analysis with haplotype data have not yet been developed, and the computational complexity of such problems has been an open question. Furthermore, it is not clear in which scenarios haplotype data would provide better estimates than genotype data for quantities such as recombination rates.
Results: To answer these questions, a reduction is given from genotype problem instances to haplotype problem instances, and it is shown that solving the haplotype problem yields the solution to the genotype problem, up to constant factors or coefficients. The pedigree analysis problems we will consider are the likelihood, maximum probability haplotype, and minimum recombination haplotype problems.
Conclusions: Two algorithms are introduced: an exponential-time hidden Markov model (HMM) for haplotype data where some individuals are untyped, and a linear-time algorithm for pedigrees having haplotype data for all individuals. Recombination estimates from the general haplotype HMM algorithm are compared to recombination estimates produced by a genotype HMM. Having haplotype data on all individuals produces better estimates. However, having several untyped individuals can drastically reduce the utility of haplotype data.
Figures




Similar articles
-
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.BMC Bioinformatics. 2012;13 Suppl 17(Suppl 17):S19. doi: 10.1186/1471-2105-13-S17-S19. Epub 2012 Dec 13. BMC Bioinformatics. 2012. PMID: 23281626 Free PMC article.
-
HAPLORE: a program for haplotype reconstruction in general pedigrees without recombination.Bioinformatics. 2005 Jan 1;21(1):90-103. doi: 10.1093/bioinformatics/bth388. Epub 2004 Jul 1. Bioinformatics. 2005. PMID: 15231536
-
Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.J Comput Biol. 2005 Jul-Aug;12(6):719-39. doi: 10.1089/cmb.2005.12.719. J Comput Biol. 2005. PMID: 16108713
-
Efficient identification of identical-by-descent status in pedigrees with many untyped individuals.Bioinformatics. 2010 Jun 15;26(12):i191-8. doi: 10.1093/bioinformatics/btq222. Bioinformatics. 2010. PMID: 20529905 Free PMC article.
-
Haplotype inference by Pure Parsimony: a survey.J Comput Biol. 2010 Aug;17(8):969-92. doi: 10.1089/cmb.2009.0101. J Comput Biol. 2010. PMID: 20726791 Review.
Cited by
-
Allele discovery of ten candidate drought-response genes in Austrian oak using a systematically informatics approach based on 454 amplicon sequencing.BMC Res Notes. 2012 Apr 3;5:175. doi: 10.1186/1756-0500-5-175. BMC Res Notes. 2012. PMID: 22472016 Free PMC article.
-
Isomorphism and similarity for 2-generation pedigrees.BMC Bioinformatics. 2015;16 Suppl 5(Suppl 5):S7. doi: 10.1186/1471-2105-16-S5-S7. Epub 2015 Mar 18. BMC Bioinformatics. 2015. PMID: 25860335 Free PMC article.
References
-
- Xiao J, Liu L, Xia L, Jiang T. Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations. SIAM Journal on Computing. 2009;38:2198. doi: 10.1137/070687591. - DOI