1.15k likes | 1.3k Views
Dirk Husmeier. Inferring gene regulatory networks from transcriptomic profiles. Biomathematics & Statistics Scotland. Overview. Introduction Application to synthetic biology Lessons from DREAM. Network reconstruction from postgenomic data. Accuracy. Mechanistic models. Bayesian networks.
E N D
Dirk Husmeier Inferring gene regulatory networks from transcriptomic profiles Biomathematics & Statistics Scotland
Overview • Introduction • Application to synthetic biology • Lessons from DREAM
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
Shortcomings Pairwise associations do not take the context of the systeminto consideration direct interaction common regulator indirect interaction co-regulation
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
1 2 Direct interaction 1 2 Conditional Independence Graphs (CIGs) Inverse of the covariance matrix strong partial correlation π12 Partial correlation, i.e. correlation conditional on all other domain variables Corr(X1,X2|X3,…,Xn) Problem: #observations < #variables Covariance matrix is singular
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
Model Parameters q Probability theory Likelihood
1) Practical problem: numerical optimization q 2) Conceptual problem: overfitting ML estimate increases on increasing the network complexity
Overfitting problem True pathway Poorer fit to the data Equal or better fit to the data Poorer fit to the data
Regularization E.g.: Bayesian information criterion Regularization term Data misfit term Maximum likelihood parameters Number of parameters Number of data points
Likelihood BIC Complexity Complexity
Model selection: find the best pathway Select the model with the highest posterior probability: This requires an integration over the whole parameter space:
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
Marriage between graph theory and probability theory Friedman et al. (2000), J. Comp. Biol. 7, 601-620
Bayes net ODE model
Model Parameters q Bayesian networks: integral analytically tractable!
Linearity assumption [A]= w1[P1]+ w2[P2] + w3[P3] + w4[P4] + noise P1 w1 P2 A w2 w3 P3 w4 P4
Accuracy Mechanistic models Bayesian networks Conditional independence graphs Methods based on correlation and mutual information Computational complexity
Our new model: heterogeneous dynamic Bayesian network. Here: 2 components
Our new model: heterogeneous dynamic Bayesian network. Here: 3 components
Learning with MCMC q Allocation vector h k Number of components (here: 3)
Learning with MCMC q Allocation vector h k Number of components (here: 3)
Non-homogeneous model Non-linear model
BGe: Linear model [A]= w1[P1]+ w2[P2] + w3[P3] + w4[P4] + noise P1 w1 P2 A w2 w3 P3 w4 P4
Can we get an approximate nonlinear model without data discretization? y x
Can we get an approximate nonlinear model without data discretization? Idea: piecewise linear model y x
Inhomogeneous dynamic Bayesian network with common changepoints
Inhomogenous dynamic Bayesian network with node-specific changepoints
Morphogenesis in Drosophila melanogaster • Gene expression measurements over 66 time steps of 4028 genes (Arbeitman et al., Science, 2002). • Selection of 11 genes involved in muscle development. Zhao et al. (2006), Bioinformatics22
Transition probabilities: flexible structure with regularization Morphogenetic transitions: Embryo larva larva pupa pupa adult
Overview • Introduction • Application to synthetic biology • Lessons from DREAM