Algorithm for Finding Optimal Gene Sets in Microarray Prediction
J. M. Deutsch
Abstract
Motivation: Microarray data has been recently been shown to be efficacious in distinguishing closely related cell types that often appear in the diagnosis of cancer. It is useful to determine the minimum number of genes needed to do such a diagnosis both for clinical use and to determine the importance of specific genes for 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 down to 15, while at the same time being able to perfectly classify all of their test data. Availability: http://stravinsky.ucsc.edu/josh/gesses/ Contact: josh@physics.ucsc.edu
Create a lesson
Related papers
Efficient Transport Networks through Edge Pruning by Relative Resistance
Mathieu Le Verge-Serandour, Viktor Vasilev, Lara Szeimies et al.
Boundary-contact repolarization provides a mechanism for directional guidance of neural crest cell collectives
Aditya Shankar Paspunurwar, Hector Gomez
Femtosecond Three-Dimensional Imaging of Single-Protein with Hard X-ray Laser
Paul Lourdu Xavier, Andrew J. Morgan, Johan Bielecki et al.
Three-dimensional imaging of isolated membrane-protein complexes in vacuo with an X-ray laser
Kartik Ayyer, Tej Varma Yenupuri, Johan Bielecki et al.
Polarization of the Drosophila oocyte by active cortical exchange
Mohammadhossein Firouznia, Wen Lu, Margot Lakonishok et al.
Inverse-Designed Anisotropic Intrastromal Corneal Exoskeletons for Keratoconus: A Three-Dimensional Computational Feasibility Study
J. Sumaya-Martinez, Alan Altamirano