University of Cambridge > Talks.cam > Cambridge Society for the Application of Research (CSAR) > Finding Patterns in Genes and Proteins

  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

Finding Patterns in Genes and Proteins

Download to your calendar using vCal

If you have a question about this talk, please contact Dr Nigel Bennee .

The Lecture will be preceded by a brief presentation by Bursary Student Siang Koh, entitled “It takes two to tango: Combination therapy in cancer”

In the post-genomic era, high-throughput methods are providing us with a deluge of data about genes and proteins.

What knowledge about biology does this new data hold?

I am working to gain a better understanding of how cells and organisms work so that we can draw on the evolutionary information inherent in the growing number of genome sequences and protein structures.

This talk will explain how computational analysis of genomic information reveals fundamental principles of gene and protein interactions.  

This talk is part of the Cambridge Society for the Application of Research (CSAR) series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambrigde Computer Lab, Lecture Theatre 1 •NIHR Cambridge Biomedical Research Centre Lecture Series, CRUK Cambridge Research Institute Lecture Theatre (Li Ka Shing Centre - Robinson Way), Addenbrooke's Site. Graduate Development Lecture Series

Other talks

Task performance predicts the substitution of feedforward by feedback drive in visual cortex Title to be confirmed Cambridge RNA Club - ONLINE Geometry and Generalization: The case of Grokking Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani ( EDI Film Screening) Content, Caching and Kubernetes: Performance and User Experience in the Browser
 

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