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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Linear Separability of Gene Expression Dataset

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Online: shorturl.at/lKGqa Homerton College Average on weekdays: 9029.03712871 kWh

Other talks

Scattering Plenty: the people who made the modern countryside Title to be confirmed Talk TBC Group Work How Far Can Good Go Without God? The Limits of a Naturalistic Ethic The rise of local cartography in Europe, 12th-14th century
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity