Skip to main content
Article thumbnail
Location of Repository

A rapid conditional enumeration haplotyping method in pedigrees

By Guimin Gao and Ina Hoeschele


Haplotyping in pedigrees provides valuable information for genetic studies (e.g., linkage analysis and association study). In order to identify a set of haplotype configurations with the highest likelihoods for a large pedigree with a large number of linked loci, in our previous work, we proposed a conditional enumeration haplotyping method which sets a threshold for the conditional probabilities of the possible ordered genotypes at every unordered individual-marker to delete some ordered genotypes with low conditional probabilities and then eliminate some haplotype configurations with low likelihoods. In this article we present a rapid haplotyping algorithm based on a modification of our previous method by setting an additional threshold for the ratio of the conditional probability of a haplotype configuration to the largest conditional probability of all haplotype configurations in order to eliminate those configurations with relatively low conditional probabilities. The new algorithm is much more efficient than our previous method and the widely used software SimWalk2

Topics: Research
Publisher: BioMed Central
OAI identifier:
Provided by: PubMed Central

Suggested articles


  1. (2006). [1] BaruchE.,WellerJ.I.,Cohen-ZinderM.,RonM.,SeroussiE.,Efficientinference of haplotypes from genotypes on a large animal pedigree,
  2. (1999). An optimal algorithm for automatic genotype elimination,
  3. (2004). Conditional probability methods for haplotyping in pedigrees,
  4. (1996). Descent graphs in pedigree analysis: applications to haplotyping, location scores, and marker sharing statistics,
  5. (2001). Estimating genotypes with independently sampled descent graphs,
  6. (2003). Haplotypingusing SIMPLE: caution on ignoring interference,
  7. (1996). IMA volumes in mathematics and its applications, Vol. 81, Genetic mapping and DNA sequencing,
  8. (2005). Maximum likelihood haplotypingfor general pedigrees,
  9. to individual-marker Mi produces Qi = qi 10α, according to step (B), we should delete ms i, but here we do not hope to delete ms i because Qi
  10. (2000). Zero-recombinanthaplotyping:applicationsto fine mapping using SNPs,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.