z-logo
Premium
Likelihood‐based approach to estimating twin concordance for dichotomous traits
Author(s) -
Witte John S.,
Carlin John B.,
Hopper John L.
Publication year - 1999
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(1999)16:3<290::aid-gepi5>3.0.co;2-8
Subject(s) - concordance , statistics , maximum likelihood , restricted maximum likelihood , biology , econometrics , mathematics , genetics
Genetic epidemiologists are well aware that the casewise and pairwise twin concordances are two different measures. In determining appropriate estimators for each of these measures, the method of ascertainment must be considered. Here, we derive expressions for the concordance estimators and their asymptotic variances appropriate to different twin ascertainment schemes using a likelihood framework, and apply these formulas to existing data. We emphasize the distinction between concordance measures (i.e., the parameters of interest) and the concordance estimators based on the number of pairs observed. Under random or complete ascertainment the casewise estimator is asymptotically unbiased for the casewise concordance, and the pairwise estimator is asymptotically unbiased for the pairwise concordance. Under incomplete ascertainment, the casewise estimator is biased for the casewise concordance, the pairwise estimator is biased for the pairwise concordance, but the probandwise estimator is asymptotically unbiased for the casewise concordance. One can extend the likelihood equations presented here to allow the concordance parameter of interest to depend on zygosity and, if measured, other factors such as cohabitation status and similarity for genetic markers, while concurrently allowing the disease prevalence to depend on measured covariates. Genet. Epidemiol. 16:290–304, 1999. © 1999 Wiley‐Liss, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here