Dynamic biclustering of microarray data by multi-objective immune optimization
- PMID: 21989068
- PMCID: PMC3194232
- DOI: 10.1186/1471-2164-12-S2-S11
Dynamic biclustering of microarray data by multi-objective immune optimization
Abstract
Background: Newly microarray technologies yield large-scale datasets. The microarray datasets are usually presented in 2D matrices, where rows represent genes and columns represent experimental conditions. Systematic analysis of those datasets provides the increasing amount of information, which is urgently needed in the post-genomic era. Biclustering, which is a technique developed to allow simultaneous clustering of rows and columns of a dataset, might be useful to extract more accurate information from those datasets. Biclustering requires the optimization of two conflicting objectives (residue and volume), and a multi-objective artificial immune system capable of performing a multi-population search. As a heuristic search technique, artificial immune systems (AISs) can be considered a new computational paradigm inspired by the immunological system of vertebrates and designed to solve a wide range of optimization problems. During biclustering several objectives in conflict with each other have to be optimized simultaneously, so multi-objective optimization model is suitable for solving biclustering problem.
Results: Based on dynamic population, this paper proposes a novel dynamic multi-objective immune optimization biclustering (DMOIOB) algorithm to mine coherent patterns from microarray data. Experimental results on two common and public datasets of gene expression profiles show that our approach can effectively find significant localized structures related to sets of genes that show consistent expression patterns across subsets of experimental conditions. The mined patterns present a significant biological relevance in terms of related biological processes, components and molecular functions in a species-independent manner.
Conclusions: The proposed DMOIOB algorithm is an efficient tool to analyze large microarray datasets. It achieves a good diversity and rapid convergence.
Figures
References
-
- Cheng Y, Church GM. Biclustering of expression data. Proc Int Conf Intell Syst Mol Biol. 2000;8(1):93–103. - PubMed
-
- Jiong Yang, Wang Wei, Wang Haixun, Yu P. In: Proceedings of Third IEEE Symposium on Bioinformatics and Bioengineering: 10-12 March, 2003 Bethesda, MD. H.J.a.V. Magalooikonomou, editor. IEEE computer society; 2003. Enhanced biclustering on expression data; pp. 321–327.
-
- Wang H, Wang W, Yang J, Yu PS. In: Proceedings of the 2002 ACM SIGMOD international conference on Management of data: 02-06 June, 2002 Madison, WI. M.J. Franklin, B. Moon, and A. Ailamaki, editor. ACM Press; 2002. Clustering by pattern similarity in large data sets; pp. 394–405.
-
- Tanay A, Sharan R, Shamir R. Discovering statistically significant biclusters in gene expression data. Bioinformatics. 2002;18(S1):S136–44. - PubMed
-
- Dhillon IS. Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining: 26-29 August, 2001; San Francisco, CA. ACM; 2001. Co-clustering documents and words using bipartite spectral graph partitioning; pp. 269–274.
Publication types
MeSH terms
LinkOut - more resources
Full Text Sources
Molecular Biology Databases
Research Materials