Skip to content
naulon

Not checkedNot checked for notices yet.

SimpleMap: A Pipeline to Streamline High-Density Linkage Map Construction

Abdulqader Jighly, Reem Joukhadar, Manickavelu Alagu

The Plant Genome · 2015

doi:10.3835/plantgenome2014.09.0056 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The recent development in high‐throughput genotyping techniques requires new statistical methods to analyze large datasets. The current available linkage mapping software are time consuming and limited in terms of the maximum number of markers that can be mapped on a single linkage group. In this paper, we propose the Perl pipeline, SimpleMap. This tool can significantly improve the speed of currently available linkage mapping software with minimal impact on marker order and map length by limiting the consideration of duplicated and tightly linked molecular markers during linkage group development. SimpleMap works with the following three main steps: (i) generating a subset of markers for which each pair has a number of recombinants higher than a threshold determined by the user (the repulsion threshold), (ii) mapping this subset with any external mapping tool, and (iii) intersecting the remaining unmapped markers to the constructed map. The script was tested on 15 wheat ( Triticum aestivum L.) linkage groups derived from two different crosses. In 13 genetic groups, the computational time was reduced from ∼8 h to ∼8 min, while it was impossible to map the remaining two linkage groups without applying SimpleMap first. SimpleMap is a very time‐efficient tool, and considering a repulsion threshold equivalent to 1 cM results in a number of markers similar to map lengths that can be analyzed on a simple personal computer. SimpleMap can be downloaded from http://simplemap‐aj.sourceforge.net/ .

Abstract licence: CC BY-NC-ND

References6

    6 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.