Rdocumentation
powered by
Learn R Programming
isa2 (version 0.3.6)
The Iterative Signature Algorithm
Description
The ISA is a biclustering algorithm that finds modules in an input matrix. A module or bicluster is a block of the reordered input matrix.
Copy Link
Link to current version
Version
Version
0.3.6
0.3.5
0.3.4
0.3.3
0.3.2-2
0.3.1-1
0.3.0
0.2.1
0.1
Install
install.packages('isa2')
Monthly Downloads
1,407
Version
0.3.6
License
CC BY-NC-SA 4.0
Issues
1
Pull Requests
0
Stars
6
Forks
5
Repository
https://github.com/gaborcsardi/ISA
Maintainer
Gabor Csardi
Last Published
February 21st, 2023
Functions in isa2 (0.3.6)
Search all functions
isa.normalize
Normalize input data for use with ISA
isa.unique
Filter out biclusters that are very similar to each other
isa.biclust
Convert ISA modules to a Biclust class, as defined by the biclust package
generate.seeds
Generate seed vectors for the Iterative Signature Algorithm
isa.in.silico
Generate in-silico input data for biclustering algorithms
isa.iterate
The Iterative Signature Algorithm
isa2-package
The isa package
isa.option
Options for the isa package
isa
Iterative Signature Algorithm
isa.sweep
Create a hierarchical structure of ISA biclusters
ppa.in.silico
Generate in-silico input data for testing the PPA algorithm
ppa
The Ping-Pong Algorithm
robustness
Robustness of ISA biclusters and PPA co-modules
ppa.unique
Filter co-modules that are very similar to each other
ppa.iterate
The Ping-Pong Algorithm
ppa.normalize
Normalize input data for use with the PPA
plotModules
Image plots of biclusters