1 Department of Engineering, 2 Department of Mathematics,

Slides:



Advertisements
Similar presentations
3- 1 Chapter 3 Introduction to Numerical Methods Second-order polynomial equation: analytical solution (closed-form solution): For many types of problems,
Advertisements

Brief introduction on Logistic Regression
Inferring Quantitative Models of Regulatory Networks From Expression Data Iftach Nachman Hebrew University Aviv Regev Harvard Nir Friedman Hebrew University.
CSE Fall. Summary Goal: infer models of transcriptional regulation with annotated molecular interaction graphs The attributes in the model.
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
Genome-wide prediction and characterization of interactions between transcription factors in S. cerevisiae Speaker: Chunhui Cai.
Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.
CISC667, F05, Lec26, Liao1 CISC 667 Intro to Bioinformatics (Fall 2005) Genetic networks and gene expression data.
Functional genomics and inferring regulatory pathways with gene expression data.
Integrated analysis of regulatory and metabolic networks reveals novel regulatory mechanisms in Saccharomyces cerevisiae Speaker: Zhu YANG 6 th step, 2006.
Lecture 5 Curve fitting by iterative approaches MARINE QB III MARINE QB III Modelling Aquatic Rates In Natural Ecosystems BIOL471 © 2001 School of Biological.
Introduction to molecular networks Sushmita Roy BMI/CS 576 Nov 6 th, 2014.
Assigning Numbers to the Arrows Parameterizing a Gene Regulation Network by using Accurate Expression Kinetics.
Epistasis Analysis Using Microarrays Chris Workman.
Modeling the Gene Expression of Saccharomyces cerevisiae Δcin5 Under Cold Shock Conditions Kevin McKay Laura Terada Department of Biology Loyola Marymount.
Software Refactoring and Usability Enhancement for GRNmap, a Gene Regulatory Network Modeling Application Mathematical Model Equation 2. Equation 3. Future.
Gaussian Processes for Transcription Factor Protein Inference Neil D. Lawrence, Guido Sanguinetti and Magnus Rattray.
Genome of the week - Deinococcus radiodurans Highly resistant to DNA damage –Most radiation resistant organism known Multiple genetic elements –2 chromosomes,
Using Bayesian Networks to Analyze Expression Data N. Friedman, M. Linial, I. Nachman, D. Hebrew University.
CJT 765: Structural Equation Modeling Class 7: fitting a model, fit indices, comparingmodels, statistical power.
Kristen Horstmann, Tessa Morris, and Lucia Ramirez Loyola Marymount University March 24, 2015 BIOL398-04: Biomathematical Modeling Lee, T. I., Rinaldi,
Comparison of methods for reconstruction of models for gene expression regulation A.A. Shadrin 1, *, I.N. Kiselev, 1 F.A. Kolpakov 2,1 1 Technological.
Reconstruction of Transcriptional Regulatory Networks
Summary Various mathematical models describing gene regulatory networks as well as algorithms for network reconstruction from experimental data have been.
Analysis of the yeast transcriptional regulatory network.
CS5263 Bioinformatics Lecture 20 Practical issues in motif finding Final project.
Changes in Gene Regulation in Δ Zap1 Strain of Saccharomyces cerevisiae due to Cold Shock Jim McDonald and Paul Magnano.
Identification of cell cycle-related regulatory motifs using a kernel canonical correlation analysis Presented by Rhee, Je-Keun Graduate Program in Bioinformatics.
© Copyright McGraw-Hill 2000
IMPROVED RECONSTRUCTION OF IN SILICO GENE REGULATORY NETWORKS BY INTEGRATING KNOCKOUT AND PERTURBATION DATA Yip, K. Y., Alexander, R. P., Yan, K. K., &
Class 23, 2001 CBCl/AI MIT Bioinformatics Applications and Feature Selection for SVMs S. Mukherjee.
Introduction to biological molecular networks
Curve Fitting Pertemuan 10 Matakuliah: S0262-Analisis Numerik Tahun: 2010.
. Finding Motifs in Promoter Regions Libi Hertzberg Or Zuk.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Inferring gene regulatory networks from multiple microarray datasets (Wang 2006) Tiffany Ko ELE571 Spring 2009.
A comparative approach for gene network inference using time-series gene expression data Guillaume Bourque* and David Sankoff *Centre de Recherches Mathématiques,
Outline S. cerevisiae, a eukaryote known for cold-shock adaption, used in cold-shock experiments Deletion strand HMO1 and the comparison of microarray.
Computational methods for inferring cellular networks II Stat 877 Apr 17 th, 2014 Sushmita Roy.
Computacion Inteligente Least-Square Methods for System Identification.
Identifying submodules of cellular regulatory networks Guido Sanguinetti Joint work with N.D. Lawrence and M. Rattray.
Inferring Regulatory Networks from Gene Expression Data BMI/CS 776 Mark Craven April 2002.
BME435 BIOINFORMATICS.
Yiming Kang, Hien-haw Liow, Ezekiel Maier, & Michael Brent
Journal club Jun , Zhen.
Chapter 7. Classification and Prediction
Reverse-engineering transcription control networks timothy s
Bulgarian Academy of Sciences
Departments of Biology and Mathematics
System Structures Identification
Bud Mishra Professor of Computer Science and Mathematics 12 ¦ 3 ¦ 2001
Control of Gene Expression
Christopher A. Penfold Vicky Buchanan-Wollaston Katherine J. Denby And
Modeling Nitrogen Metabolism in Yeast
1 Department of Engineering, 2 Department of Mathematics,
Introduction to Instrumentation Engineering
9 Tests of Hypotheses for a Single Sample CHAPTER OUTLINE
dCIN5 and Wildtype Transcription Factor Mapping in Cold Shock
CISC 841 Bioinformatics (Spring 2006) Inference of Biological Networks
1 Department of Engineering, 2 Department of Mathematics,
KEY CONCEPT Entire genomes are sequenced, studied, and compared.
The Future of Genetic Research
dCIN5 and Wildtype Transcription Factor Mapping in Cold Shock
Analyzing Time Series Gene Expression Data
SEG5010 Presentation Zhou Lanjun.
Principle of Epistasis Analysis
Unfolding with system identification
CISC 667 Intro to Bioinformatics (Spring 2007) Genetic networks and gene expression data CISC667, S07, Lec24, Liao.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Presentation transcript:

1 Department of Engineering, 2 Department of Mathematics, Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T., and Vohradsky, J. (2006) Nucleic Acids Research 35: 279-287. Jeffrey Crosson1 Kara M. Dismuke2 Natalie E. Williams3 1 Department of Engineering, 2 Department of Mathematics, 3 Department of Biology BIOL398-04/MATH388 March 24, 2015

Outline Introduction Constructing and Testing the Model Dynamics of Model Computational algorithm Dataset selection Inference of regulators Comparison with linear model Discussion Summary

Outline Introduction Constructing and Testing the Model Dynamics of Model Computational algorithm Dataset selection Inference of regulators Comparison with linear model Discussion Summary

Introduction Regulation of gene expression controls cellular processes Microarray data tracks dynamics of gene expression Nonlinear differential equation to predict and model gene expression Many methods in identifying relationships between genes and their regulators Depends on promoter sequences which allow binding of regulatory transcription factors Gene expression is altered as cell undergoes different environmental conditions and stresses or stages in its life cycle

Outline Introduction Constructing and Testing the Model Dynamics of Model Computational algorithm Dataset selection Inference of regulators Comparison with linear model Discussion Summary

Dynamic Model of Transcriptional Control A result of previous work on the dynamic simulation of genetic networks Assumes the recursive action of regulators on the target gene over time Assumes the regulatory effect on the expression can be expressed as a combinatorial action of its regulators g = regulatory effect for a certain gene j = 1, 2, … m m = number of regulators for a gene w = regulatory weights y = expression levels b = transcription initiation delay ⍴ = sigmoid function of regulatory effect 1 2a 2b

Dynamic Model of Transcriptional Control (Continued) z = target gene expression level dz/dt = rate of expression k1 = maximal rate of expression k2 = rate constant of degradation a values = computed from the experimental gene expression profile using least squares minimization procedure E = error function The polynomial fit is an approximation of the true expression profile Gene profiles that minimize the mean square error function are sought for The result allows the parameters in the differential equation to be estimated 3 4 5 6

Computational Algorithm The aim is to find a set of potential regulators of a certain target gene by estimating its expression profile It searches from a group of transcriptional regulators using least squares minimization, the differential equation, and the error function The differential equation is solved numerically The parameters w, b, k1, and k2 are optimized with a least squares minimization loop The missing data points and fluctuation in gene expression profiles is compensated for by approximating the regulator gene profiles by a polynomial of degree n The degree n is chosen by the number of of data points in the profile and the level of fluctuations

Computational Algorithm (Continued) Fit regulator gene profiles with a polynomial of degree n Select a target gene Select a candidate regulatory gene from the pool of possible regulators Apply least squares minimization procedure to the target and regulator genes using the differential equation with the error function Repeat step 3 for all possible regulators Select regulators that best satisfy the selection criterion Repeat step 2 for all target genes 5 4 6

Dataset Selection The eukaryotic cell cycle dataset published by Spellman and others was chosen to evaluate the performance of the model The dataset records changes in gne expressions using microarrays at 18 points in time over two cell cycle periods 800 genes were identified whose expression was associated with the cell cycle, but the real number of regulators controlling the cell cycle is much smaller Therefore 184 potential regulator genes were selected for the identification of yeast cell cycle regulators By combining data from previous published papers and the YEASTRACT database 40 target genes were selected The same ones in the paper by Chen and others

Inference of Regulators Data in form of log base 2 of ratio between RNA amount and value of standard (same for all time points) Least squares minimization for each target gene for all potential regulators Approximation of unknown real profile = least squares best fit of polynomial of degree n to target gene expression profile zp Estimation of overall error Deviation from experimental data

Inference of Regulators Find regulator profile using: model (Eqn 4) minimizing E (Eqn 6) Assumption: fit of model to target regulator profile is at least as good as fit given by Eqn 8 in other words: deviation E (Eqn 6) must be ≤ deviation E1 (Eqn 9) Choose regulators where E ≤ E1 Determine which regulators fit target gene profile better than the others (call “best regulators”) Correct Identification: regulator identified was also regulator in YEASTRACT YEASTRACT: current knowledge, but still incomplete Find regulator profile (to then find most probable regulator)

Table 1: Summary of identification of regulators for 40 selected yeast cell cycle regulated genes

Figure 1: Regulators that are repressors have the “opposite” curve as the target genes and reconstructed target curve x: target (data known about gene beforehand) dotted: took x data, used paper’s model to generate non-linear curve solid: considers “best regulators” and chooses THE best one -based on regulator profile (as determined by model’s best target profile & minimization of E) -for activator: mirrors -for repressor: opposite -Note: we know we are looking for an activator or a repressor to be a particular gene’s best regulator based on the sign of weight (w) (used in the algorithm) A: These 6 graphs: Regulators are repressors repressor: turns off target gene expression

Figure 2: Regulators that are activators have a similar curve as the target genes and the reconstructed target curve x: target (data known about gene beforehand) dotted: took x data, used paper’s model to generate non-linear curve solid: considers “best regulators” and chooses THE best one -based on regulator profile (as determined by model’s best target profile & minimization of E) -for activator: mirrors -for repressor: opposite -Note: we know we are looking for an activator or a repressor to be a particular gene’s best regulator based on the sign of weight (w) (used in the algorithm) B: These 6 Graphs: Regulators are activators activator: turns on (promotes) target gene expression

Figure 3: The amount of runs used to correctly identify at least one regulator was lower for the nonlinear model. A: Nonlinear model B: Linear model Distribution of order of correctly identified regulators in the sorted list Histogram of distribution of the order of correctly identified regulators in the sorted list of potential regulators. for each target gene, we have list of regulators in order of best to worst...min number- least number of tries to get correct regulator -ranked list: determined by model and E value draw on blackboard?

Outline Introduction Constructing and Testing the Model Dynamics of Model Computational algorithm Dataset selection Inference of regulators Comparison with linear model Discussion Summary

Discussion: The nonlinear model was able to pair target gene expression with its regulator Nonlinear algorithm selected the most probable regulator and provided information about how well it controls the target gene Drawbacks: The model does not test indirect controls of target genes; Regulators are selected from a pool independently, usually through sequence analysis; Does not consider that individual target genes may regulate other target genes; and, Transcriptional regulation also is controlled by proteins which cannot be recorded by microarrays microarrays look only at mRNA expression

Discussion: The nonlinear algorithm can lead to further explorations in modeling gene regulatory networks. This model focuses on analyzing the influence of all possible regulators of a given target gene and recover basic transcriptional regulations Combinatorial control and larger networks can be created by the addition of smaller medium-scale gene regulatory networks In the future, the speed of the algorithm will improve and the algorithm may have additional extensions that could allow it to consider other factors in constructing these networks other factors: genome-wide location data, DNA sequence information, and targeted biochemical and molecular biological experiments

Outline Introduction Constructing and Testing the Model Dynamics of Model Computational algorithm Dataset selection Inference of regulators Comparison with linear model Discussion Summary

Summary The dynamics of the model were given by: The least squares best fit was then compared to the deviations from the experimental data, which resulted in: Table 1 identified regulators for the target genes Figures 1 & 2 had the best expression profiles of target/regulator pairs Figure 3 shows the distribution of the order of correctly identified regulators in the sorted list The model is capable of correctly identifying regulators, modeling expression profiles, and predicting if regulators repress or activate