Efficient and accurate construction of genetic linkage maps from the minimum spanning tree of a graph.

ABSTRACT: Genetic linkage maps are cornerstones of a wide spectrum of biotechnology applications, including map-assisted breeding, association genetics, and map-assisted gene cloning. During the past several years, the adoption of high-throughput genotyping technologies has been paralleled by a substantial increase in the density and diversity of genetic markers. New genetic mapping algorithms are needed in order to efficiently process these large datasets and accurately construct high-density genetic maps. In this paper, we introduce a novel algorithm to order markers on a genetic linkage map. Our method is based on a simple yet fundamental mathematical property that we prove under rather general assumptions. The validity of this property allows one to determine efficiently the correct order of mar

SUBMITTER: Wu Y 

PROVIDER: S-EPMC2556103 | biostudies-literature | 2008 Oct

REPOSITORIES: biostudies-literature