University of Cambridge > Talks.cam > Computational and Systems Biology > Identifying deletions and duplications from PCR data

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Identifying deletions and duplications from PCR data

Download to your calendar using vCal

  • UserDr. Andy Lynch (Department of Oncology)
  • ClockWednesday 31 January 2007, 14:00-15:00
  • HouseMR5, DAMTP.

If you have a question about this talk, please contact Gos Micklem .

All welcome and please feel free to join us for coffee and biscuits after the talk in the Pavilion G common room

In this talk I will be taking a clinical example of screening for a disease (von Hippel-Lindau disease) using PCR to detect genetic mutations, and asking whether the conventional analysis method is ideal. I will then discuss the advantages of approaches using techniques such as Markov Chain Monte Carlo and the EM algorithm. This is an example where there is not much scope to improve on the accuracy of existing methods (given enough data they do a good enough job) but we can perhaps improve the efficiency, providing the answer more quickly (cheaply).

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

Pharmacology Lecture Theatre, Tennis Court Road Enterprise Tuesday 2009/2010 In person, Computer Laboratory, William Gates Building.

Other talks

Discovery Investigations: Science, Empire and the Making of the British South Atlantic Title to be confirmed Bigger Picture Talk: Developing future marine engines running on ammonia and other green fuels CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Wolfson Tool Factory Emergency Medicine and Metabolic Medicine
 

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