Elston–Stewart algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The Elston–Stewart algorithm is an algorithm for computing the likelihood of observed genotype data given a pedigree. It is due to Robert Elston and John Stewart. It can handle relatively large pedigrees providing they are (almost) outbred. Its computation time is exponential in the number of markers. It is used in the analysis of genetic linkage.

References[edit]

  • Elston, R. C., Stewart, J. (1970) "A new test of association for continuous variables", Biometrics, 26, 305–314
  • Elston, R. C., Stewart, J. (1971) "A general model for the genetic analysis of pedigree data". Hum Hered., 21, 523–542
  • Elston R.C., George V.T., Severtson F. (1992) "The Elston-Stewart algorithm for continuous genotypes and environmental factors", Hum Hered., 42(1), 16–27.
  • Stewart J. (1992) "Genetics and Biology: A Comment on the Significance of the Elston-Stewart Algorithm", Hum Hered., 42, 9–15 doi:10.1159/000154042