Counting algorithms for linkage
- 1 May 1990
- journal article
- Published by Wiley in Annals of Human Genetics
- Vol. 54 (2) , 103-106
- https://doi.org/10.1111/j.1469-1809.1990.tb00365.x
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- MAP, an expert system for multiple pairwise linkage analysisAnnals of Human Genetics, 1989
- Some simple methods for linkage analysisAnnals of Human Genetics, 1989
- Multipoint mapping and the emperor's clothesAnnals of Human Genetics, 1988
- MAPMAKER: An interactive computer package for constructing primary genetic linkage maps of experimental and natural populationsGenomics, 1987
- Construction of multilocus genetic linkage maps in humans.Proceedings of the National Academy of Sciences, 1987
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- A Mapping Function for ManHuman Heredity, 1977
- The Systematic Location of Genes by Means of Crossover ObservationsThe American Naturalist, 1922