z-logo
Premium
Alternative test for linkage between two loci
Author(s) -
Cleves Mario A.,
Elston Robert C.
Publication year - 1997
Publication title -
genetic epidemiology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.301
H-Index - 98
eISSN - 1098-2272
pISSN - 0741-0395
DOI - 10.1002/(sici)1098-2272(1997)14:2<117::aid-gepi2>3.0.co;2-4
Subject(s) - linkage (software) , recombination fraction , mathematics , test statistic , likelihood ratio test , recombination , statistic , statistics , null hypothesis , combinatorics , chi square test , statistical hypothesis testing , genetics , biology , gene mapping , chromosome , gene
Abstract When using the maximum likelihood method to test for linkage it is traditionally assumed that the female (θ f ) and male (θ m ) recombination fractions are equal. However, this assumption is not always realistic. In this paper we present a test for linkage that does not require this assumption. Specifically, we propose testing for linkage by testing the null hypothesis H o : θ f + θ m = 1 vs. the alternative H A : θ f + θ m < 1, treating θ f − θ m as a nuisance parameter. This leads to a likelihood ratio test statistic that is asymptotically distributed as a chi‐square with one degree of freedom. By examining the expected values of the maximum lod scores, we show that for data from phase‐known meioses this test can provide a more powerful test for linkage—especially so when θ f ≠ θ m —unless the recombination fraction is zero. For data from phase‐unknown meioses, the proposed test is a more powerful test for linkage only for large values of |θ f − θ m |; otherwise, the traditional test has higher power. Thus, the proposed test can lead to gain in power for detecting linkage when either phase is known for most meioses or when there is a large absolute difference between the male and female recombination fractions. Genet. Epidemol. 14:117–131,1997. © 1997 Wiley‐Liss, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here