Clustering Gene Expression Data with Memetic Algorithms based on Minimum Spanning Trees

Abstract

With the invention of microarray technology, researchers are capable of measuring the expression levels of ten thousands of genes in parallel at various time points of the biological process. During the investigation of gene regulatory networks and general cellular mechanisms, biologists are attempting to group genes based on the time-depending pattern of the obtained expression levels. In this paper, we propose a new Memetic Algorithm a Genetic Algorithm combined with local search based on a tree representation of the data a Minimum Spanning Tree for clustering gene expression data. The combination of both concepts is shown to find near-optimal solutions quickly. Due to the Minimum Spanning Tree representation of the data, our algorithm is capable of finding clusters of different shapes. We show, that our approach is superior in solution quality compared to classical clustering methods.

7 Figures and Tables

Cite this paper

@inproceedings{Speer2003ClusteringGE, title={Clustering Gene Expression Data with Memetic Algorithms based on Minimum Spanning Trees}, author={Nora Speer and Peter Merz and Christian Spieth and Andreas Zell}, year={2003} }