Bioinformatics Vol. 19 no. 1 2003
Pages 45-52
© 2003 Oxford University Press
Evolutionary algorithms for finding optimal gene sets in microarray prediction
University of California, Santa Cruz, USA
Received on August 8, 2001
; revised on December 5, 2001 and July 10, 2002
; accepted on July 12, 2002
Motivation: Microarray data has been shown recently to be efficacious in distinguishing closely related cell types that often appear in different forms of cancer, but is not yet practical clinically. However, the data might be used to construct a minimal set of marker genes that could then be used clinically by making antibody assays to diagnose a specific type of cancer. Here a replication algorithm is used for this purpose. It evolves an ensemble of predictors, all using different combinations of genes to generate a set of optimal predictors.
Results: We apply this method to the leukemia data of the Whitehead/MIT group that attempts to differentially diagnose two kinds of leukemia, and also to data of Khan et al. to distinguish four different kinds of childhood cancers. In the latter case we were able to reduce the number of genes needed from 96 to less than 15, while at the same time being able to classify all of their test data perfectly. We also apply this method to two other cases, Diffuse large B-cell lymphoma data (Shipp et al., 2002), and data of Ramaswamy et al. on multiclass diagnosis of 14 common tumor types.
Availability: http://stravinsky.ucsc.edu/josh/gesses/
Contact: josh{at}physics.ucsc.edu
* To whom correspondence should be addressed.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  A. W. Norris and C. R. Kahn Analysis of gene expression in pathophysiological states: Balancing false discovery and false negative rates PNAS, January 17, 2006; 103(3): 649 - 653. [Abstract] [Full Text] [PDF]
|
|