q-order partial correlation graph search algorithm CRAN Task View: gR (http://CRAN.R-project.org/view=gR) 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. Software Depends: R (>= 2.10) Robert Castelo <robert.castelo@upf.edu> Robert Castelo <robert.castelo@upf.edu>, Alberto Roverato <alberto.roverato@unibo.it> GPL (>= 2) 2012-03-19 application/tgz http://CRAN.R-project.org/package=qp