title: Finding multiple coherent biclusters in microarray data using variable string length multiobjective genetic algorithm.
abstract: Microarray technology enables the simultaneous monitoring of the expression pattern of a huge number of genes across different experimental conditions. Biclustering in microarray data is an important technique that discovers a group of genes that are coregulated in a subset of conditions. Biclustering algorithms require to identify coherent and nontrivial biclusters, i.e., the biclusters should have low mean squared residue and high row variance. A multiobjective genetic biclustering technique is proposed here that optimizes these objectives simultaneously. A novel encoding scheme that uses variable chromosome length is developed. Moreover, a new quantitative measure to evaluate the goodness of the biclusters is proposed. The performance of the proposed algorithm has been evaluated on both simulated and real-life gene expression datasets, and compared with some other well-known biclustering techniques.
authors.affiliation: Department of Computer Science and Engineering, Jadavpur University, Kolkata 700032, India. drumaulik@cse.jdvu.ac.in
authors.forename: Ujjwal
authors.initials: U
authors.lastname: Maulik
authors.forename: Anirban
authors.initials: A
authors.lastname: Mukhopadhyay
authors.forename: Sanghamitra
authors.initials: S
authors.lastname: Bandyopadhyay
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D030541:Databases, Genetic; D020869:Gene Expression Profiling; D006801:Humans; D007938:Leukemia; D008957:Models, Genetic; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D015003:Yeasts