Research Library

Premium Counting algorithms for linkage
Author(s)
MORTON N. E.,
COLLINS A.
Publication year1990
Publication title
annals of human genetics
Resource typeJournals
PublisherBlackwell Publishing Ltd
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.
Subject(s)algorithm , biochemistry , biology , botany , chemistry , computation , computer science , convergence (economics) , economic growth , economics , gene , layering , linkage (software) , mathematics
Language(s)English
SCImago Journal Rank0.537
H-Index77
eISSN1469-1809
pISSN0003-4800
DOI10.1111/j.1469-1809.1990.tb00365.x

Seeing content that should not be on Zendy? Contact us.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here