ORICC1-package: One-stage ORICC

ORICC1R Documentation

One-stage ORICC


One-stage ORICC is a computationally efficient information criterion-based clustering algorithm for selecting and clustering genes according to their time-course or dose-response profiles. This algorithm takes account of the ordering in time-course or dose-response experiments by embedding the order-restricted inference into a model selection framework. This algorithm mainly consist of two steps. In the first step, candidate profiles are defined in terms of inequalities among mean expression levels at different time points or doses levels. In the second step, genes are assigned to the best matched profiles determined by an information criterion for order-restricted inference.





A matrix containing the gene expressions.


Column indices of the gene expression data.


Column index of the gene ID. Defaults to 1.


A vector consisting of the number of replicate arrays at time points (1, 2,... ,T), where T is the total number of time points.


The number of genes kept for the final clustering result. Genes are ranked based on expression variation across time or dose levels. Defaults to all genes ORICC1 selects


Transformation of the original data:

0=None, 1=natural log, 2=square root, 3=cubic root. Defaults to 0.


A character string specifying the collection of candidate profiles. This option only supports monotone, up-down and down-up profiles specified as by



paste("up down max at",i,sep=" ");

paste("down up min at",j,sep=" ");

If name.profile="all", the ‘decreasing’, ‘increasing’ and all ‘up-down’ and ‘down-up’ profiles will be included.

If name.profile=NULL, ‘decreasing’, ‘increasing’ and all ‘up-down’ and ‘down-up’ profiles will be absent. Defaults to NULL.

One can also specify several up-down or down-up profiles together as follows.

profile1=paste("up down max at",c(2,4),sep=" ");

profile2=paste("down up min at",c(3,5),sep=" ");


then up-down profile with maxima at 2 and 4 as well as down-up profile with minima at 3 and 5 will be included.


A matrix with 2 columns. Each element of the matrix must be a number in the set {2,3,...,T-1}. Each row of the matrix represents a cyclical profile with minima at the first entry of the row and maxima at the 2nd entry. As a result, two elements in the same row must be different. For example, if

cyclical.profile=matrix(c(2,3,4,3),2,2,byrow=T), then the cyclical profile with minima at 2 and maxima at 3 and the cyclical profile with minima at 4 and maxima at 3 will be included as candidate profiles.

If cyclical.profile=NULL, all cyclical profiles will be absent. Defaults to NULL.


The complete.profile means a profile in which there is no defined inequality constraint.

If the complete.profile is a candidate profile,

complete.profile=1, otherwise,

complete.profile=NULL. Defaults to NULL.


logical: if true (the default) multiple figures for different clusters are output in one file. If FALSE, each cluster is plotted in a seperate file. Defaults to TRUE.


The format of the output file containing plots of gene clusters.Users can choose between ‘eps’ and ‘jpg’. Defaults to ‘eps’.


The gene expression dataset should be in a tab-delimited txt file, in which the first two columns contain the gene names and their accession numbers or descriptions, and the remaining columns, in their orders, are the geneexpression data (contain multiple columns, i.e. data.col).The dataset is assumed to have been processed so that each row contains the expressions of only one gene.


The results are displayed in a graphical form. The graphics can be stored in a JPG or EPS format. Both the raw gene expression values and the estimated mean expressions are output to external files ‘cluster of raw data.txt’ and ‘cluster of fitted mean data.txt’, respectively.


Tianqing Liu, Nan Lin, Ningzhong Shi and Baoxue Zhang

Maintainer: Tianqing Liu <tianqingliu@gmail.com>


Liu, T., Lin, N., Shi, N. and Zhang, B. (2009), Information criterion-based clustering with order-restricted candidate profiles in short time-course microarray experiments. BMC Bioinformatics, 10: 146.



ORIClust documentation built on June 23, 2022, 9:10 a.m.