Ensemble of regression trees by Andy Liaw and Matthew Wiener,
Learned Pattern Similarity (LPS) for time series by
Mustafa Gokce Baydogan

LP Nonparametric Approach to Non-Gaussian Non-Linear Time Series
Modelling
Specially designed rank transform based Legendre Polynomial-like (LP) orthonormal transformations are implemented for non-linear signal processing.

Lag Penalized Weighted Correlation for Time Series Clustering
Thevaa Chandereng <chandereng@wisc.edu>, Anthony Gitter
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>.

c(
person("Thevaa", "Chandereng", ,"chandereng@wisc.edu", c("cre", "aut")),
person("Anthony", "Gitter", ,"gitter@biostat.wisc.edu", "aut"))
Thevaa Chandereng [cre, aut],
Anthony Gitter [aut]

c(person(given = "Thevaa",
family = "Chandereng",
role = c("aut", "cre", "cph"),
email = "chandereng@wisc.edu",
comment = c(ORCID = "0000-0003-4078-9176")),
person(given = "Anthony",
family = "Gitter",
role = c("aut", "cph"),
comment = c(ORCID = "0000-0002-5324-9833")))
Thevaa Chandereng [aut, cre, cph]
(<https://orcid.org/0000-0003-4078-9176>),
Anthony Gitter [aut, cph] (<https://orcid.org/0000-0002-5324-9833>)

testthat, rmarkdown, pkgdown, ggplot2, knitr, devtools

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

Merging linkage maps by linear programming
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.