Logo image
An Efficient Algorithm for Ordering Random Genomic Clones
Technical documentation   Open access

An Efficient Algorithm for Ordering Random Genomic Clones

Kyungsook Han and Michiel Noordewier
Rutgers University
1992
DOI:
https://doi.org/10.7282/T3Z89GXV

Abstract

Physical maps Fingerprints Restriction enzymes, DNA
We propose an algorithm which efficiently constructs a physical map of DNA from a fingerprinted library of random clones. The algorithm clusters clones into contiguous regions using restriction enzyme digest data. Clones which contain overlapping genomic regions are detected and are grouped into an island in such a way that disjoint islands which can be linked by the clones are joined together automatically. This approach solves a common problem in fingerprinting { linking disjoint islands becomes more difficult and slow as mapping goes on. A map is produced in O(km2 n) time where k is the number of cleavage sites of a clone, m is the number of clones in a library, and n is the number of libraries. Our approach provides a general and efficient means for constructing long-range physical maps in large-scale genome mapping.
pdf
An Efficient Algorithm for Ordering Random Genomic Clones188.59 kBDownloadView
Version of Record (VoR) Open Access
url
Report an accessibility issueView
Please complete a content remediation request to report an accessibility issue with a library electronic resource, website, or service.

Metrics

132 File downloads
58 Record Views

Details

Logo image