Nothing
LPmerge: Merging Linkage Maps by Linear Programming
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Jeffrey Endelman |
| Maintainer | Jeffrey Endelman <endelman@wisc.edu> |
| License | GPL-3 |
| Version | 1.7 |
| URL | http://potatobreeding.cals.wisc.edu/software |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the LPmerge package in your browser
Any scripts or data that you put into this service are public.
