Inference in hierarchical transcriptional network motifs
published: Nov. 8, 2010, recorded: October 2010, views: 220
Report a problem or upload filesIf 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.
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.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !