Minimum-recombinant haplotyping in pedigrees.
This article presents a six-rule algorithm for the reconstruction of multiple minimum-recombinant haplotype configurations in pedigrees. The algorithm has three major features: First, it allows exhaustive search of all possible haplotype configurations under the criterion that there are minimum recombinants between markers. Second, its computational requirement is on the order of O(J(2)L(3)) in current implementation, where J is the family size and L is the number of marker loci under analysis. Third, it applies to various pedigree structures, with and without consanguinity relationship, and allows missing alleles to be imputed, during the haplotyping process, from their identical-by-descent copies. Haplotyping examples are provided using both published and simulated data sets.
Qian
Dajun
D
Department of Preventive Medicine, University of Southern California, 1540 Alcazar Street, CHP 218, Los Angeles, CA 90089, USA. gqian@usc.edu
Beckmann
Lars
L
D000465:Algorithms; D001259:Ataxia / Q000235:genetics*; D003198:Computer Simulation; D005260:Female; D023061:Gene Order / Q000235:genetics; D005838:Genotype; D006239:Haplotypes / Q000235:genetics*; D006801:Humans; D008297:Male; D009679:Nuclear Family; D010375:Pedigree; D011995:Recombination, Genetic / Q000235:genetics*; D012107:Research Design