Description Usage Arguments Details Value References Examples
Find the largest subset of markers such that no two adjacent markers are separated by less than some distance.
1 | reduce_markers(map, weights = NULL, min_distance = 1)
|
map |
A list with each component being a vector with the marker positions for a chromosome. |
weights |
A (optional) list of weights on the markers; same
size as |
min_distance |
Minimum distance between markers. |
Uses a dynamic programming algorithm to find, for each
chromosome, the subset of markers for with max(weights
) is
maximal, subject to the constraint that no two adjacent markers may
be separated by more than min_distance
.
A list like the input map
, but with the selected
subset of markers.
Broman KW, Weber JL (1999) Method for constructing confidently ordered linkage maps. Genet Epidemiol 16:337–343
1 | library(qtl)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.