Jump to content

Lander–Green 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 Lander-Green algorithm is an algorithm, due to Eric Lander and Philip Green for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage.