Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

J. M. Deutsch

dblp:53/6533 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › cancer genomics
cancer classification
0.012003
Evolutionary algorithms for finding optimal gene sets in microarray prediction · Bioinform. 2003
Bioinformatics and computational biology
gene expression analysis
0.012003
Evolutionary algorithms for finding optimal gene sets in microarray prediction · Bioinform. 2003
Bioinformatics and computational biology › gene expression analysis
gene selection
0.012003
Evolutionary algorithms for finding optimal gene sets in microarray prediction · Bioinform. 2003
Bioinformatics and computational biology › gene expression analysis › gene expression classification
microarray classification
0.012003
Evolutionary algorithms for finding optimal gene sets in microarray prediction · Bioinform. 2003

Methods — techniques the papers use, named apart from their topics

evolutionary algorithm · 0.0ensemble of predictors · 0.0
YearPublicationVenuePosition
2003 Evolutionary algorithms for finding optimal gene sets in microarray prediction
abstract
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/.
J. M. Deutsch
Bioinform.1