reduce_markers: Reduce markers to a subset of more-evenly-spaced ones

Description Usage Arguments Details Value References Examples

Description

Find the largest subset of markers such that no two adjacent markers are separated by less than some distance.

Usage

1
reduce_markers(map, weights = NULL, min_distance = 1)

Arguments

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 map.

min_distance

Minimum distance between markers.

Details

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.

Value

A list like the input map, but with the selected subset of markers.

References

Broman KW, Weber JL (1999) Method for constructing confidently ordered linkage maps. Genet Epidemiol 16:337–343

Examples

1
library(qtl)

rqtl/qtl2geno documentation built on May 28, 2019, 2:36 a.m.