conquer: Conquer function of BiMax algorithm
In matirosset/Algorithmique_biclustering: Rcpp package with biclustering algorithms (BiMax, Bibit, iBBiG)
Description
Usage
Arguments
Value
Description
Find all inclusion-maximal biclusters in a binary submatrix using the BiMax algorithm
Usage
1
conquer(E, submat, Z)
Arguments
E
a binary matrix with values 0 and 1
submat
a list [G,C], the vector G corresponds to the submatrix'rows, C corresponds to the submatrix'columns
Z
list of vector of columns CV
Value
a vector of biclusters (G,C), G bicluster'rows, C bicluster'columns
matirosset/Algorithmique_biclustering documentation built on Feb. 3, 2022, 6:27 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
Description
Find all inclusion-maximal biclusters in a binary submatrix using the BiMax algorithm
Usage
1 | conquer(E, submat, Z)
|
Arguments
E |
a binary matrix with values 0 and 1 |
submat |
a list [G,C], the vector G corresponds to the submatrix'rows, C corresponds to the submatrix'columns |
Z |
list of vector of columns CV |
Value
a vector of biclusters (G,C), G bicluster'rows, C bicluster'columns
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.