Efficient Haplotype Inference Algorithms in One Whole Genome Scan for Pedigree Data with Non-Genotyped Founders
Full Text: Cheng2009_Article_EfficientHaplotypeInferenceAlg.pdf
An efficient rule-based algorithm is presented for haplotype inference from general pedigree genotype data, with the assumption of no recombination. This algorithm generalizes previous algorithms to handle the cases where some pedigree founders are not genotyped, provided that for each nuclear family at least one parent is genotyped and each non-genotyped founder appears in exactly one nuclear family. The importance of this generalization lies in that such cases frequently happen in real data, because some founders may have passed away and their genotype data can no longer be collected. The algorithm runs in O(m 3 n 3) time, where m is the number of single nucleotide polymorphism (SNP) loci under consideration and n is the number of genotyped members in the pedigree. This zero-recombination haplotyping algorithm is extended to a maximum parsimoniously haplotyping algorithm in one whole genome scan to minimize the total number of breakpoint sites, or equivalently, the number of maximal zero-recombination chromosomal regions. We show that such a whole genome scan haplotyping algorithm can be implemented in O(m 3 n 3) time in a novel incremental fashion, here m denotes the total number of SNP loci along the chromosome.
Citation
Y. Cheng, H. Sabaa, Z. Cai, R. Goebel, G. Lin. "Efficient Haplotype Inference Algorithms in One Whole Genome Scan for Pedigree Data with Non-Genotyped Founders". 25(3), pp 477-488, May 2009.| Keywords: | Haplotype inference, efficient algorithm, pedigree, whole genome scan |
| Category: | In Journal |
| Web Links: | DOI |
| Springer |
BibTeX
@article{Cheng+al:09,
author = {Yongxi Cheng and Hadi Sabaa and Zhipeng Cai and Randy Goebel and
Guohui Lin},
title = {Efficient Haplotype Inference Algorithms in One Whole Genome Scan
for Pedigree Data with Non-Genotyped Founders},
Volume = "25",
Number = "3",
Pages = {477-488},
year = 2009,
}Last Updated: February 13, 2020Submitted by Sabina P
