Lander E S, Green P
Proc Natl Acad Sci U S A. 1987 Apr;84(8):2363-7. doi: 10.1073/pnas.84.8.2363.
Human genetic linkage maps are most accurately constructed by using information from many loci simultaneously. Traditional methods for such multilocus linkage analysis are computationally prohibitive in general, even with supercomputers. The problem has acquired practical importance because of the current international collaboration aimed at constructing a complete human linkage map of DNA markers through the study of three-generation pedigrees. We describe here several alternative algorithms for constructing human linkage maps given a specified gene order. One method allows maximum-likelihood multilocus linkage maps for dozens of DNA markers in such three-generation pedigrees to be constructed in minutes.
人类遗传连锁图谱最准确的构建方式是同时使用来自多个基因座的信息。一般来说，用于这种多位点连锁分析的传统方法在计算上是令人望而却步的，即使使用超级计算机也是如此。由于目前旨在通过对三代系谱的研究构建完整的人类DNA标记连锁图谱的国际合作，这个问题已具有实际重要性。我们在此描述了几种在给定特定基因顺序的情况下构建人类连锁图谱的替代算法。其中一种方法能在数分钟内构建出这种三代系谱中数十个DNA标记的最大似然多位点连锁图谱。
