The use of transposons offers the possibility of a directed approach to DNA
sequencing, where a target DNA up to about 6kb in length can be sequenced
quickly and with minimal redundancy. Transposons are mobile DNA elements wh
ich can be inserted in a reasonably random fashion into the target DNA, An
important part of this process is the location of the transposon insertions
(known as mapping) and the selection of a sensible subset of transposons t
o use as priming sites for sequencing reactions. This paper presents a prob
abilistic method of scoring selected subsets of transposons and a graph-the
oretic algorithm for selection of a subset of maximal score.