New algorithm improves fine structure of the barley consensus SNP map.

ABSTRACT:

Background

The need to integrate information from multiple linkage maps is a long-standing problem in genetics. One way to visualize the complex ordinal relationships is with a directed graph, where each vertex in the graph is a bin of markers. When there are no ordering conflicts between the linkage maps, the result is a directed acyclic graph, or DAG, which can then be linearized to produce a consensus map.

Results

New algorithms for the simplification and linearization of consensus graphs have been implemented as a package for the R computing environment called DAGGER. The simplified consensus graphs produced by DAGGER exactly capture the ordinal relationships present in a series of linkage maps. Using either linear or quadratic programming, DAGGER generates a consensus m

SUBMITTER: Endelman JB 

PROVIDER: S-EPMC3179964 | biostudies-literature | 2011 Aug

REPOSITORIES: biostudies-literature