Analysis of gene expression profiles: an application of memetic algorithms to the minimum sum-of-squares clustering problem.
Microarrays have become a key technology in experimental molecular biology since they allow monitoring of gene expression for more than 10,000 genes in parallel producing huge amounts of data. In the exploration of transcriptional regulatory networks, an important task is to cluster gene expression data to identify groups of genes with similar patterns and hence similar function. In this paper, memetic algorithms (MAs)-evolutionary algorithms incorporating local search-are proposed for minimum sum-of-squares clustering (MSSC). In a fitness landscape analysis, it is shown that the MSSC problem has correlation structure exploitable by MAs. The proposed MAs are shown to be superior to multi-start k-means as well as five other clustering algorithms from the bioinformatics literature including hierarchical algorithms and self-organizing maps. Although the fitness values of the different clustering solutions lie close together, it is shown that the solutions differ significantly from each other in terms of cluster memberships which is extremely important for the biological interpretation of the clustering results.
Merz
Peter
P
University of Tübingen, Center of Bioinformatics (ZBIT), Sand 1, D-72076 Tübingen, Germany. peter.merz@ieee.org
D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D016000:Cluster Analysis; D020869:Gene Expression Profiling / Q000379:methods*; D018922:HL-60 Cells; D006801:Humans; D016018:Least-Squares Analysis; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D010363:Pattern Recognition, Automated; D010802:Phylogeny; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software; D015003:Yeasts / Q000235:genetics