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 which 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 to use as priming sites for sequencing reactions. This paper presents a probabilistic method of scoring selected subsets of transposons and a graph-theoretic algorithm for selection of a subset of maximal score.