title: Two new recursive likelihood calculation methods for genetic analysis.
abstract: Recursive likelihood calculations for genetic analysis with ungenotyped pedigree data employ variations of the Elston-Stewart (ES) or the Lander-Green (LG) algorithms. With the ES algorithm, the number of loci may be limited but not the pedigree size. With the LG algorithm, the reverse is the case. We introduce two new algorithms for the computation of regressive likelihoods for pedigrees with multivariate traits. The first is an alternative formulation of our existing model, which leads to a simpler form in the binary trait, polygenic and mixed model cases. The second is an approximation model, which is computationally efficient. These methods apply to both continuous and binary traits, in the oligogenic and polygenic cases. Both methods coincide in the binary case. We considered these methods for cases in which all the traits are controlled by a single locus, with each trait controlled by one locus independent to the others. Simulation studies and analysis of a real data are presented for segregation analysis as illustrations. These methods can also be used in other model-based analyses. These methods are implemented in G.E.M.S., the genetic epidemiology models software.
authors.affiliation: National Human Genome Center, Howard University, Statistical Genetics and Bioinformatics Unit, Washington DC, USA. ayuan@howard.edu
authors.forename: Ao
authors.initials: A
authors.lastname: Yuan
authors.forename: George E
authors.initials: GE
authors.lastname: Bonney
mesh_terms: D000818:Animals; D003627:Data Interpretation, Statistical; D005823:Genetics / Q000706:statistics & numerical data*; D006801:Humans; D016013:Likelihood Functions; D020412:Multifactorial Inheritance / Q000235:genetics; D010375:Pedigree