Jump to content

Lander–Green algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Toot123toot (talk | contribs) at 15:43, 15 May 2008 (Created page with '{{stub}} The '''Lander-Green algorithm''' is an algorithm for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relati...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Lander-Green algorithm is an algorithm 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.