A computer program for constructing a maximum‐likelihood map from linkage data and its application to human chromosome 1
- 1 October 1984
- journal article
- Published by Wiley in Annals of Human Genetics
- Vol. 48 (4) , 333-345
- https://doi.org/10.1111/j.1469-1809.1984.tb00847.x
Abstract
Summary: An algorithm is described which attempts to find the maximum likelihood order of the loci on a chromosome using linkage data. It can also use data on locus order if these are available. A computer program which applies this algorithm has been written, and tested on the data for human chromosome 1. The most likely possible order is GDH, PGD, ENO1, Rh, UMPK, Sc, PGM1, AMY, Fy, CAE, 1qh, CMT1, AT3, PEPC.Keywords
This publication has 12 references indexed in Scilit:
- Family data on sixteen chromosome 1 lociAnnals of Human Genetics, 1984
- Reduction of physical assignments to a standard lod table: Chromosome 1Human Genetics, 1981
- The barley chromosome 5 linkage mapHereditas, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Demonstration of a sex difference in recombination fraction in the loose linkage, Rh and PGM1Annals of Human Genetics, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Lutheran‐Secretor recombination fraction in man: a possible sex differenceAnnals of Human Genetics, 1965
- Stocks for detecting linkage in the mouse, and the theory of their designJournal of Genetics, 1951
- THE ESTIMATION OF MAP DISTANCES FROM RECOMBINATION VALUESAnnals of Eugenics, 1943
- The genetics ofPrimula sinensisJournal of Genetics, 1935