Elston–Stewart algorithm
![]() | This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (November 2019) |
The Elston–Stewart algorithm is an algorithm for computing the likelihood of observed data on a pedigree assuming a general model under which specific genetic segregation, linkage and association models can be tested. It is due to Robert Elston and . It can handle relatively large pedigrees providing they are (almost) outbred. When used for linkage analysis its computation time is exponential in the number of markers, in contrast to the Lander-Green algorithm, which has computational time exponential in the number of pedigree members.
References[]
- 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
- Elston, R.C. (2020) "An accidental genetic epidemiologist", Annu Rev Genom Hum Genet., in press.
Categories:
- Genetic epidemiology
- Statistical genetics
- Genetic linkage analysis
- Statistical algorithms
- Genetics stubs
- Statistics stubs