Title: Lag Penalized Weighted Correlation for Time Series Clustering
Author: Thevaa Chandereng <chandereng@wisc.edu>, Anthony Gitter
Description: Computes a time series distance measure for clustering based on weighted correlation and introduction of lags. The lags capture delayed responses in a time series dataset. The timepoints must be specified. T. Chandereng, A. Gitter (2018) <doi:10.1101/292615>.
Packaged: 2018-04-11 21:03:34 UTC; thevaasiinenchandereng

person("Thevaa", "Chandereng", ,"chandereng@wisc.edu", c("cre", "aut")),
Packaged: 2018-06-04 10:49:13 UTC; thevaasiinenchandereng

Packaged: 2018-10-28 19:55:38 UTC; thevaasiinenchandereng
Author: Thevaa Chandereng [aut, cre, cph]
Anthony Gitter [aut, cph] (<https://orcid.org/0000-0002-5324-9833>)

Suggests: testthat, rmarkdown, pkgdown, ggplot2, knitr, devtools
Packaged: 2019-03-11 19:26:13 UTC; thevaasiinenchandereng

Description: Computes a time series distance measure for clustering based on weighted correlation and introduction of lags. The lags capture delayed responses in a time series dataset. The timepoints must be specified. T. Chandereng, A. Gitter (2020) <doi:10.1186/s12859-019-3324-1>.
Packaged: 2020-01-23 17:54:19 UTC; thevaasiinenchandereng

Title: Merging linkage maps by linear programming
Description: LPmerge creates a composite (or 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 composite 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.

Description: 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.