Premium
Counting algorithms for linkage
Author(s) -
MORTON N. E.,
COLLINS A.
Publication year - 1990
Publication title -
annals of human genetics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.537
H-Index - 77
eISSN - 1469-1809
pISSN - 0003-4800
DOI - 10.1111/j.1469-1809.1990.tb00365.x
Subject(s) - linkage (software) , computer science , algorithm , computational biology , genetics , biology , gene
SUMMARY 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.