LPmerge creates a consensus genetic map by merging linkage maps from different populations. The software uses linear programming (LP) to efficiently minimize the mean absolute error between the consensus map and the linkage maps. This minimization is performed subject to linear inequality constraints that ensure the ordering of the markers in the linkage maps is preserved. When marker order is inconsistent between linkage maps, a minimum set of ordinal constraints is deleted to resolve the conflicts.
|Maintainer:||Jeffrey Endelman <endelman at wisc.edu>|
|Citation:||LPmerge citation info|
|CRAN checks:||LPmerge results|
|Windows binaries:||r-devel: LPmerge_1.6.zip, r-release: LPmerge_1.6.zip, r-oldrel: LPmerge_1.6.zip|
|OS X Snow Leopard binaries:||r-release: LPmerge_1.6.tgz, r-oldrel: LPmerge_1.6.tgz|
|OS X Mavericks binaries:||r-release: LPmerge_1.6.tgz|
|Old sources:||LPmerge archive|