Figure 1

Diagram of the DAGGER package. Linkage maps are first converted into unbranched directed graphs, where each vertex is a marker bin and each edge length is the distance of the corresponding map interval. After merging the linkage maps, the consensus graph is checked for cycles, which represent ordering conflicts. Provided there are none, the consensus graph can be simplified to generate an ordinal consensus graph, which contains only those edges needed for ordinal equivalency with the linkage maps. The consensus graph can also be linearized to produce a consensus map, using either linear or quadratic programming (latter is shown).