一种用于根据连锁数据构建最大似然图谱的计算机程序及其在人类1号染色体上的应用。
A computer program for constructing a maximum-likelihood map from linkage data and its application to human chromosome 1.
作者信息
Wedd N
出版信息
Ann Hum Genet. 1984 Oct;48(4):333-45. doi: 10.1111/j.1469-1809.1984.tb00847.x.
Abstract
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.
摘要
本文描述了一种算法，该算法试图利用连锁数据找出染色体上基因座的最大似然顺序。如果有基因座顺序的数据，它也可以使用这些数据。已经编写了一个应用此算法的计算机程序，并在人类1号染色体的数据上进行了测试。最可能的顺序是GDH、PGD、ENO1、Rh、UMPK、Sc、PGM1、AMY、Fy、CAE、1qh、CMT1、AT3、PEPC。
Zotero 插件