Format

Send to

Choose Destination
Am J Hum Genet. 2002 Jun;70(6):1434-45. Epub 2002 Apr 25.

Minimum-recombinant haplotyping in pedigrees.

Author information

1
Department of Preventive Medicine, University of Southern California, 1540 Alcazar Street, CHP 218, Los Angeles, CA 90089, USA. gqian@usc.edu

Abstract

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.

PMID:
11992251
PMCID:
PMC379131
DOI:
10.1086/340610
[Indexed for MEDLINE]
Free PMC Article

Supplemental Content

Full text links

Icon for Elsevier Science Icon for PubMed Central
Loading ...
Support Center