Analysis of gene expression profiles: An application of memetic algorithms to the minimum sum-of-squares clustering problem

BioSystems

Volumn 72, Issue 1-2, 2003, Pages 99-109

  Merz, Peter ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Clustering; Combinatorial optimization; Evolutionary algorithms; k Means

Indexed keywords

ALGORITHM; BIOINFORMATICS; GENE EXPRESSION;

ALGORITHM; ANALYTIC METHOD; ARTICLE; BIOINFORMATICS; CLUSTER ANALYSIS; CORRELATION ANALYSIS; GENE EXPRESSION PROFILING; GENETIC ANALYSIS; INTERMETHOD COMPARISON; MOLECULAR EVOLUTION; STRUCTURE ANALYSIS;

EID: 0344861996     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(03)00137-0     Document Type: Article

References (29)

1. Ben-Dor A., Shamir R., Yakhini Z., Clustering gene expression patterns. J. Comput. Biol. 6(3/4):1999;281-297.
2. Brazma A., Vilo J., Gene expression data analysis. FEBS Lett. 480(1):2000;17-24.
3. Brucker P., On the complexity of clustering problems. Lecture Notes in Economics and Mathematical Systems. 157:1978;45-54.
4. Cho R.J., Campbell M.J., Winzeler E.A., Conway S., Wodicka L., Wolfsberg T.G., Gabrielian A.E., Landsman D., Lockhart D.J., Davis R.W., A genome-wide transcriptional analysis of the mitotic cell cycle. Mol. Cell. 2:1998;65-73.
5. Dawkins, R., 1976. The Selfish Gene. Oxford University Press, Oxford.
6. Eisen, M., Spellman, P., Botstein, D., Brown, P., 1998. Cluster analysis and display of genome-wide expression patterns. In: Proceedings of the National Academy of Sciences, vol. 95, USA, pp. 14863-14867.
7. Eshelman, L., 1991. The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Rawlings, G.J.E. (Ed.), Foundations of Genetic Algorithms. Morgan Kauffman, San Francisco, CA, pp. 265-283.
8. Falkenauer, E., Marchand, A., 2003. Clustering microarray data with evolutionary algorithms. In: Fogel, G.B., Corne, D.W. (Eds.), Evolutionary Computation in Bioinformatics. Morgan Kauffman, San Francisco, CA, pp. 219-230.
9. Forgy E.W., Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics. 21:1965;768-769.
10. Freisleben, B., Merz, P., 1996. New genetic local search operators for the Traveling Salesman Problem. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (Eds.), Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature - PPSN IV. Lecture Notes in Computer Science, vol. 141. Springer, Berlin, pp. 890-900.
11. Gorges-Schleuter, M., 1989. ASPARAGOS: an asynchronous parallel genetic optimization strategy. In: Schaffer, J.D. (Ed.), Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kauffman, San Francisco, CA, pp. 422-427.
12. MacQueen, J., 1967. Some methods of classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297.
13. Merz, P., 2000. Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany.
14. Merz, P., Freisleben, B., 1999. Fitness landscapes and memetic algorithm design. In: Corne, D., Dorigo, M., Glover, F. (Eds.), New Ideas in Optimization. McGraw-Hill, London, pp. 245-260.
15. Merz P., Freisleben B., Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4):2000a;337-352.
16. Merz P., Freisleben B., Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evol. Comput. 8(1):2000b;61-91.
17. Merz P., Freisleben B., Memetic algorithms for the Traveling Salesman Problem. Complex Syst. 13(4):2001;297-345.
18. Merz, P., Zell, A., 2002. Clustering gene expression profiles with memetic algorithms. In: Merelo Guervós, J.J., Adamidis, P., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (Eds.), Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature, PPSN VII. Lecture Notes in Computer Science, vol. 2439. Springer, Berlin, Heidelberg, pp. 811-820.
19. Moscato, P., 1989. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report C3P Report 826, Caltech Concurrent Computation Program, California Institue of Technology.
20. Moscato, P., Norman, M.G., 1992. A memetic approach for the Traveling Salesman Problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (Eds.), Parallel Computing and Transputer Applications. IOS Press, Amsterdam, pp. 177-186.
21. Moscato, P., Tinetti, F., 1994. Blending heuristics with a population-based approach: a memetic algorithm for the Traveling Salesman Problem. Technical Report CeTAD, CeTAD, Universitad Nacional de La Plata.
22. Schwefel, H.-P., 1977. Numerische optimierung von computer-modellen mittels der evolutionsstrategie. Interdisciplinary Systems Research, vol. 26. Birkhäuser Verlag, Basel.
23. Syswerda, G., 1989. Uniform crossover in genetic algorithms. In: Schaffer, J.D. (Ed.), Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kauffman, San Francisco, CA, pp. 2-9.
24. Tamayo, P., Slonim, D., Mesirov, J., Zhu, Q., Kitareewan, S., Dmitrovsky, E., Lander, E.S., Golub, T.R., 1999. Interpreting patterns of gene expression with self-organizing maps: methods and application to hematopoietic differentiation. In: Proceedings of the National Academy of Sciences, vol. 96, USA. pp. 2907-2912.
25. Tavazoie S., Hughes J.D., Campbell M.J., Cho R.J., Church G.M., Systematic determination of genetic network architecture. Nat. Genet. 22:1999;281-285.
26. Wright, S., 1932. The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In: Proceedings of the Sixth Congress on Genetics, vol. 1, Brooklyn, New York, p. 365.
27. Xu Y., Olman V., Xu D., Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics. 18(4):2002;536-545.
28. Yeung K., Haynor D., Ruzzo W., Validating clustering for gene expression data. Bioinformatics. 17(4):2001;309-318.
29. Zhang M., Large-scale gene expression data analysis: a new challenge to computational biologists. Genome Res. 9:1999;681-688.