Asset Details
Do you wish to reserve the book?
Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph
Do you wish to request the book?
Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph
2008
Overview
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 markers by computing the minimum spanning tree of an associated graph. Our empirical studies obtained on genotyping data for three mapping populations of barley (Hordeum vulgare), as well as extensive simulations on synthetic data, show that our algorithm consistently outperforms the best available methods in the literature, particularly when the input data are noisy or incomplete. The software implementing our algorithm is available in the public domain as a web tool under the name MSTmap.
Publisher
Public Library of Science,Public Library of Science (PLoS)
Subject
/ Chromosome Mapping - statistics & numerical data
/ Computational Biology/Population Genetics
/ Computer Science/Numerical Analysis and Theoretical Computing
/ Genetics and Genomics/Bioinformatics
/ Genetics and Genomics/Population Genetics
/ Genomics
/ Genotype
/ Polymorphism, Single Nucleotide
/ Software
/ Studies
