University of Cambridge > > Computational and Systems Biology > Linear Separability of Gene Expression Dataset

Linear Separability of Gene Expression Dataset

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Danielle Stretch.

We examine simple geometric properties of gene expression datasets, where samples are taken from two distinct classes (e.g. two types of cancer). Specifically, the problem of linear separability for pairs of genes is investigated. We developed and implemented novel, highly efficient algorithmic tools for finding all pairs of genes that induce a linear separation of the two sample classes. These tools are based on computational geometric properties, and were applied to ten publicly available cancer datasets. We discovered that seven out of the ten datasets examined are highly separable. Statistically, this phenomenon is highly significant, and is very unlikely to occur at random.

This talk is part of the Computational and Systems Biology series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity