|
|||||||||||
News
May 1
Our paper Reliable detection of subclonal
single-nucleotide variants in tumor cell populations appeared in Nature Communications today (see also ETH Life). In this work, we present the deepSNV algorithm and demonstrate its capability to detect subclonal mutations present in only 1/10,000 cells.
Gerstung et al. (2012) Nat Commun 3:811. DOI: 10.1038/ncomms1814.
This course offers an introduction to graphical models and their application to complex biological systems. Graphical models combine a statistical methodology with efficient algorithms for inference in settings of high dimension and uncertainty. The unifying graphical model framework is developed and used to examine several classical and topical computational biology methods.
The goal of this course is to establish the common language of graphical models for applications in computational biology.
Graphical models are a marriage between probability theory and graph theory. They combine the notion of probabilities with efficient algorithms for inference among many random variables. Graphical models play an important role in computational biology, because they explicitly address two features that are inherent to biological systems: complexity and uncertainty. We will develop the basic theory and the common underlying formalism of graphical models and discuss several computational biology applications. Topics covered include conditional independence, Bayesian networks, Markov random fields, Gaussian graphical models, EM algorithm, junction tree algorithm, model selection, Dirichlet process mixture, causality, the pair hidden Markov model for sequence alignment, probabilistic phylogenetic models, phylo-HMMs, microarray experiments and gene regulatory networks, protein interaction networks, learning from perturbation experiments, time series data and dynamic Bayesian networks. Some of the biological applications will be explored in small data analysis problems as part of the exercises
Course number: 262-0002-00L
|
Date, Time |
Room |
|
| Lecture | Thursday, 10am – 12pm | CAB H 56 |
| Tutorial | Thursday, 12pm – 1pm |
CAB H 56 |
All lectures will be given in English and are accompanied by a 1h tutorial. For each tutorial, there will be assignments that need to be handed in (schedule to be announced). The final grade is 50% weekly exercises and 50% an individual oral exam.
| # |
Date |
Title |
Slides |
Exercises | Additional material |
| 1 | Feb 19 | Bayesian networks and gene regulation | Lecture 01 |
Exercises 01 Project 1 |
Spellman.R Boettcher2003 |
| 2 | Feb 26 | Expectation Maximization algorithm and motif finding | Lecture 02 |
Exercises 02 |
|
| 3 | Mar 5 | Hidden Markov models and sequence alignment | Lecture 03 |
Exercises 03 |
|
| 4 | Mar 12 | Pair HMMs and profile HMMs | Lecture 04 |
Exercises 04 Project 2 |
D1.txt D2.txt Lx.txt |
| 5 | Mar 19 | Exact inference in graphical models: sum-product algorithm | Lecture 05 |
Exercises 05 |
|
| 6 | Mar 26 | Statistical phylogenetics | Lecture 06 |
Exercises 06 |
|
| 7 | Apr 2 | Approximate inference: sampling and variational inference | Lecture 07 |
Exercises 07
Project 3 |
GoujonEtAl ApeManual PhangornManual Phylo.R ParisRT ParisC2C4 |
| 8 | Apr 9 | Model selection | Lecture 08 |
Exercises 08 |
|
| Apr 16 | --- Easter break --- | ||||
| 9 | Apr 23 | Dynamic Bayesian networks and time course gene expression data | Lecture 09 |
Exercises 09 Project 4 |
Lebre Paper G1DBN manual Spellman Data nSpellman.R "True" net. data |
|
10 |
Apr 30 | Dirichlet process mixture and haplotype inference | Lecture 10 |
Exercises 10 |
Neal2000 Zagordi2009 |
| 11 | May 7 | Learning from interventions, Causality |
Lecture 11 |
Exercises 11 |
|
| 12 | May 14 | Conjunctive Bayesian networks and genetic progression of cancer | Lecture 12 |
Project 5
Exercises 12 |
TreschEtAl Nems.R |
| May 21 | --- Ascension Day --- | ||||
| 13 | May 28 | The junction tree algorithm | Lecture 13 | Barber course notes |
Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne
graphische Elemente dargestellt. Die Funktionalität der
Website ist aber trotzdem gewährleistet. Wenn Sie diese
Website regelmässig benutzen, empfehlen wir Ihnen, auf
Ihrem Computer einen aktuellen Browser zu installieren. Weitere
Informationen finden Sie auf
folgender
Seite.
Important Note:
The content in this site is accessible to any browser or
Internet device, however, some graphics will display correctly
only in the newer versions of Netscape. To get the most out of
our site we suggest you upgrade to a newer browser.
More
information