A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A fast random cost algorithm for physical mapping
1994
Proceedings of the National Academy of Sciences of the United States of America
Ordering clones from a genomic library into physical maps of whole chromosomes presents a central computational/statIcal problem in genetics. Here we present a physical mapping algorithm for creating ordered genomic libraries or config maps by using a random cost approach [Berg, A. (1993) Nature (London) 361, 708-7101. 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
doi:10.1073/pnas.91.23.11094
pmid:7972016
pmcid:PMC45173
fatcat:miitsycwpjbszl6wadavqfhfxm