Inference in hierarchical transcriptional network motifs

author: Andrea Ocone, School of Informatics, University of Edinburgh
published: Nov. 8, 2010,   recorded: October 2010,   views: 3426
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

We present a novel inference methodology to reverse engineer the dynamics of transcription factors (TFs) in hierarchical network motifs such as feed-forward loops. The approach we present is based on a continuous time representation of the system where the high level master TF is represented as a two state Markov jump process driving a system of differential equations. We present an approximate variational inference algorithm and show promising preliminary results on a realistic simulated data set.

See Also:

Download slides icon Download slides: mlsb2010_ocone_iht_01.pdf (378.2 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: