ISA 1.0.0 – Iterative Signature Algorithm

ISA 1.0.0


The ISA (Iterative Signature Algorithm) was designed to reduce the complexity of very large sets of data by decomposing it into so-called “modules”. In the context of gene expression data these modules consist of subsets of genes that exhibit a coherent expression profile only over a subset of microarray experiments. Genes and arrays may be attributed to multiple modules and the level of required coherence can be varied resulting in different “resolutions” of the modular mapping. Since the ISA does not rely on the computation of correlation matrices (like many other tools), it is extremely fast even for very large datasets.



Computational Biology Group ,Department of Medical Genetics, University of Lausanne








Phys Rev E Stat Nonlin Soft Matter Phys. 2003 Mar;67(3 Pt 1):031902. Epub 2003 Mar 11.
Iterative signature algorithm for the analysis of large-scale gene expression data.
Bergmann S, Ihmels J, Barkai N.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.