Benchmarking a memetic algorithm for ordering microarray data.
This work introduces a new algorithm for "gene ordering". Given a matrix of gene expression data values, the task is to find a permutation of the gene names list such that genes with similar expression patterns should be relatively close in the permutation. The algorithm is based on a combined approach that integrates a constructive heuristic with evolutionary and Tabu Search techniques in a single methodology. To evaluate the benefits of this method, we compared our results with the current outputs provided by several widely used algorithms in functional genomics. We also compared the results with our own hierarchical clustering method when used in isolation. We show that the use of images, corrupted with known levels of noise, helps to illustrate some aspects of the performance of the algorithms and provide a complementary benchmark for the analysis. The use of these images, with known high-quality solutions, facilitates in some cases the assessment of the methods and helps the software development, validation and reproducibility of results. We also propose two quantitative measures of performance for gene ordering. Using these measures, we make a comparison with probably the most used algorithm (due to Eisen and collaborators, PNAS 1998) using a microarray dataset available on the public domain (the complete yeast cell cycle dataset).
Moscato
P
P
Newcastle Bioinformatics Initiative, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle, Callaghan, NSW 2308, Australia. Pablo.Moscato@newcastle.edu.au
Mendes
A
A
Berretta
R
R
D000465:Algorithms; D016000:Cluster Analysis; D003627:Data Interpretation, Statistical; D020869:Gene Expression Profiling / Q000706:statistics & numerical data; D046228:Microarray Analysis / Q000706:statistics & numerical data*; D009154:Mutation; D011995:Recombination, Genetic; D012984:Software; D049490:Systems Biology