Counting algorithms for linkage

Ann Hum Genet. 1990 May;54(2):103-6. doi: 10.1111/j.1469-1809.1990.tb00365.x.

Abstract

The Lander-Green algorithm is algebraically different from the EM algorithm that maximizes likelihood. In our experience the numerical difference is very small. Since computations are no easier or convergence faster for the Lander-Green algorithm, there is no reason to prefer it to EM. As suggested by Green (personal communication), layering is advantageous. Occasional updating of the information weights might also be considered to accelerate mapping.

MeSH terms

  • Algorithms*
  • Genetic Linkage*
  • Models, Genetic*