Jump to content

Elston–Stewart algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Koavf (talk | contribs) at 23:18, 17 May 2008 (replace cat. per speedy CfD, added orphan tag using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.