An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA.
An algorithm is described for mapping DNA contigs based on an interval graph (IG) representation. In general terms, the input to the algorithm is a set of binary overlapping relations among finite intervals spread along a real line, from which the algorithm generates sets of ordered overlapping fragments spanning that line. The implications of a more general case of the IG, called a probe interval graph (PIG), in which only a subset of cosmids are used as probes, are also discussed. In the specific case of cosmids hybridizing to regions of a YAC, the algorithm takes cross-hybridization information using the cosmids as probes, and orders them along the YAC; if gaps exist due to insufficient coverage of cosmid contigs along the length of the YAC, repetitive use of the algorithm generates sets of ordered overlapping fragments. Both the IG and the PIG can expose problems caused by false overlaps, such as hybridizations due to repetitive elements. The algorithm, has been coded in C; CPU time is essentially linear with respect to the number of cosmids analyzed. Results are presented for the application of a PIG to cosmid contig assembly along a human chromosome 13-specific YAC. An alignment of 67 cosmids spanning a YAC took 0.28 seconds of CPU time on a Convex 220 computer.
Zhang
P
P
Department of Genetics, Columbia University College of Physicians and Surgeons, New York, NY 10032.
Schon
E A
EA
Fischer
S G
SG
Cayanis
E
E
Weiss
J
J
Kistler
S
S
Bourne
P E
PE
D000465:Algorithms; D002874:Chromosome Mapping; D016386:Chromosome Walking; D002882:Chromosomes, Human, Pair 13 / Q000235:genetics; D003360:Cosmids / Q000235:genetics; D004247:DNA / Q000235:genetics*; D006801:Humans; D011381:Programming Languages; D016415:Sequence Alignment
D004247:DNA