Efficient, robust, and unified method for mapping complex traits (I): Two-point linkage analysis

✍ Scribed by Zhao, Lue Ping; Quiaoit, Fil; Hsu, Li; Aragaki, Corinne

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 71 KB
• Volume: 77
• Category: Article
• ISSN: 0148-7299
• DOI: 10.1002/(sici)1096-8628(19980605)77:5<366::aid-ajmg5>3.0.co;2-l

✦ Synopsis

The completion of a preliminary human genome map and development of molecular methods have enabled researchers to assay a large number of polymorphic markers that are evenly spaced along the entire human genome. Among many applications, marker data are valuable for mapping complex traits through linkage or linkage-disequilibrium analysis, the former of which is the focus of this paper, the first in a series on this subject. Formalizing the concept and computation for linkage analysis, Elston and Stewart [1971; Human Heredity 21:523-542] introduced a likelihood function to capture relevant genetic information and a recursive algorithm for computing the likelihood function. However, the computing burden is prohibitive in processing complex pedigrees. Since that fundamental development, improving the computational algorithm and extending the method has been a dynamic area of research. The primary objective of this communication is to introduce a semiparametric method for linkage analysis. It is a particularly suitable approach with desirable properties for mapping complex traits that may be binary, continuous, and partially observed (i.e., censored). It incorporates candidate genes, environmental factors, and their interactions with the putative gene and is expected to be robust and efficient in comparison with likelihood-based methods. The properties of the estimates have been studied in finite samples with a limited simulation study. This method is illustrated with an application to family data contributed to the Breast Cancer Consortium.