Dynamic Modelling of Microarray Data
Description
We recently released rHVDM (Hidden Variable Dynamic Modelling), an R/Bioconductor package that predicts targets of a known transcription factor using time course microarray data. The key feature behind the algorithm is a simple ODE model of mRNA concentration. In the first stage of rHVDM, transcription factor activity (the hidden variable) is deduced from the expression time profile of a small number of known targets. This information is then used to screen other genes for dependency on that transcription factor. The accuracy of the technique has been demonstrated with Affymetrix microarray time course data and verified experimentally using siRNA knockdown of a targeted transcription factor (p53). While implementing the rHVDM algorithm and refining it for release we encountered a number of problems. These included parameter identifiability, parameter count reduction, algorithmic speed, parameter domain restriction, confidence interval estimation, and measurement noise. I will discuss each of these issues individually, along with the techniques we used to address them.
| Slides | |
| 0:03 | Dynamic modelling of microarray data. |
| 0:25 | Outline |
| 1:00 | Gene expression model |
| 2:44 | Algorithm Principle: |
| 3:41 | slide5 |
| 4:13 | The p53 network |
| 4:51 | Experimental setup |
| 5:30 | Results of training step: activity profile of p53 |
| 6:20 | Screening |
| 7:00 | TITLE |
| 7:58 | P21: part of training set |
| 9:17 | Verification experiment |
| 10:32 | Ingredients needed |
| 11:44 | ODE integration |
| 13:28 | 2) Model fitting |
| 14:49 | Fitting algorithms: |
| 14:56 | Difference between MCMC and LM confidence intervals. |
| 15:25 | Importance of confidence intervals |
| 16:20 | Parameter count reduction / identifiability |
| 17:25 | Confidence intervals importance II |
| 18:42 | Measurement error |
| 20:21 | Acknowledgements |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
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.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




