Wang Y, Prade R A, Griffith J, Timberlake W E, Arnold J
Department of Genetics, University of Georgia, Athens 30602.
Proc Natl Acad Sci U S A. 1994 Nov 8;91(23):11094-8. doi: 10.1073/pnas.91.23.11094.
Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational/statistical problem in genetics. Here we present a physical mapping algorithm for creating ordered genomic libraries or contig maps by using a random cost approach [Berg, A. (1993) Nature (London) 361, 708-710]. This random cost algorithm is 5-10 times faster than existing physical mapping algorithms and has optimization performance comparable to existing procedures. The speedup in the algorithm makes practical the widespread use of bootstrap resampling to assess the statistical reliability of links in the physical map as well as the use of more elaborate physical mapping criteria to improve map quality. The random cost algorithm is illustrated by its application in assembling a physical map of chromosome IV from the filamentous fungus Aspergillus nidulans.
将基因组文库中的克隆排序到完整染色体的物理图谱中是遗传学中的一个核心计算/统计问题。在此，我们提出一种物理图谱构建算法，通过使用随机成本方法来创建有序的基因组文库或重叠群图谱[伯格，A.（1993年）《自然》（伦敦）361卷，708 - 710页]。这种随机成本算法比现有的物理图谱构建算法快5到10倍，并且具有与现有程序相当的优化性能。该算法的加速使得广泛使用自助重采样来评估物理图谱中连接的统计可靠性以及使用更精细的物理图谱构建标准来提高图谱质量成为可能。通过将其应用于组装丝状真菌构巢曲霉的第四条染色体的物理图谱，对随机成本算法进行了说明。
