biclust (version 2.0.1)

BCBimax: The Bimax Bicluster algorithm

Description

Performs Bimax Biclustering based on the framework by Prelic et. al.(2006). It searches for submatrices of ones in a logical matrix. Uses the original C code of the authors.

Usage

# S4 method for matrix,BCBimax
biclust(x, method=BCBimax(), minr=2, minc=2, number=100)
# S4 method for matrix,BCrepBimax
biclust(x, method=BCrepBimax(), minr=2, minc=2, number=100, maxc=12)

Arguments

x

A logical matrix which represents the data.

method

Here BCBimax, to perform Bimax algorithm

minr

Minimum row size of resulting bicluster.

minc

Minimum column size of resulting bicluster.

number

Number of Bicluster to be found.

maxc

Maximum column size of resulting bicluster.

Value

Returns an object of class Biclust.

References

Prelic, A.; Bleuler, S.; Zimmermann, P.; Wil, A.; Buhlmann, P.; Gruissem, W.; Hennig, L.; Thiele, L. & Zitzler, E. A Systematic Comparison and Evaluation of Biclustering Methods for Gene Expression Data Bioinformatics, Oxford Univ Press, 2006, 22, 1122-1129

See Also

biclust, Biclust

Examples

# NOT RUN {
<!-- %loma<-matrix(sample(c(0,1),1600,replace=TRUE),40,40) -->
# }
# NOT RUN {
 test <- matrix(rnorm(5000), 100, 50)
 test[11:20,11:20] <- rnorm(100, 3, 0.1)
 loma <- binarize(test,2)
 res <- biclust(x=loma, method=BCBimax(), minr=4, minc=4, number=10)
 res
# }