Skip to main navigation Skip to search Skip to main content

An evolutionary algorithm for discovering biclusters in gene expression data of breast cancer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

The analysis of gene expression data of breast cancer is important for discovering the signatures that can classify different subtypes of tumors and predict prognosis. Biclustering algorithms have been proven to be able to group the genes with similar expression patterns under a number of samples and offer the capability to analyze the microarray data of cancer. In this study, we propose a new biclustering algorithm which uses an evolutionary search procedure. The algorithm is applied to the conditions to search for combinations of conditions for a potential bicluster. Preliminary results using synthetic and real yeast data sets demonstrate that our algorithm outperforms several existing ones. We have also applied the method to real microarray data sets of breast cancer, and successfully found several biclusters, which can be used as signatures for differentiating tumor types.

Original languageEnglish
Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
Pages829-834
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China
Duration: 1 Jun 20086 Jun 2008

Publication series

Name2008 IEEE Congress on Evolutionary Computation, CEC 2008

Conference

Conference2008 IEEE Congress on Evolutionary Computation, CEC 2008
Country/TerritoryChina
CityHong Kong
Period1/06/086/06/08

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 3 - Good Health and Well-being
    SDG 3 Good Health and Well-being

Fingerprint

Dive into the research topics of 'An evolutionary algorithm for discovering biclusters in gene expression data of breast cancer'. Together they form a unique fingerprint.

Cite this