A novel biclustering with parallel genetic algorithm

A novel biclustering algorithm is proposed in this paper, which can be used to cluster gene expression data. One of the contributions of this paper is a novel and effective residue function of the biclustering algorithm. Furthermore, the parallel genetic algorithm is firstly used to the algorithm of the biclustering for gene expression data. This method can avoid local convergence in the optimal algorithm mostly. The Yeast Saccharomyces cerevisiae cell cycle gene expression profiles from the Spellman´s data to bicluster are used to test the performance of new algorithm. And we compared our algorithm with traditional genetic algorithm in biclustering. The results reveal that novel proposed algorithms could discover the interesting patterns in the gene expression profiles.