qp: q-order partial correlation graph search algorithm

This package is deprecated and it is now only a stub for the newer version called qpgraph available through the Bioconductor project. The q-order partial correlation graph search algorithm, q-partial, or qp, algorithm for short, is a robust procedure for structure learning of undirected Gaussian graphical Markov models from "small n, large p" data, that is, multivariate normal data coming from a number of random variables p larger than the number of multidimensional data points n as in the case of, e.g., microarray data.

Version: 0.3-2
Depends: R (≥ 2.10)
Published: 2012-03-19
Author: Robert Castelo, Alberto Roverato
Maintainer: Robert Castelo <robert.castelo at upf.edu>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
In views: gR
CRAN checks: qp results


Reference manual: qp.pdf
Package source: qp_0.3-2.tar.gz
Windows binaries: r-devel: qp_0.3-2.zip, r-release: qp_0.3-2.zip, r-oldrel: qp_0.3-2.zip
OS X Snow Leopard binaries: r-release: qp_0.3-2.tgz, r-oldrel: qp_0.3-2.tgz
OS X Mavericks binaries: r-release: qp_0.3-2.tgz
Old sources: qp archive