VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Slides:



Advertisements
Similar presentations
Numbers Treasure Hunt Following each question, click on the answer. If correct, the next page will load with a graphic first – these can be used to check.
Advertisements

Repaso: Unidad 1 Lección 2
Adders Used to perform addition, subtraction, multiplication, and division (sometimes) Half-adder adds rightmost (least significant) bit Full-adder.
AP STUDY SESSION 2.
1
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Chapter 3 Demand and Behavior in Markets. Copyright © 2001 Addison Wesley LongmanSlide 3- 2 Figure 3.1 Optimal Consumption Bundle.
© 2008 Pearson Addison Wesley. All rights reserved Chapter Seven Costs.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 6 Author: Julia Richards and R. Scott Hawley.
Author: Julia Richards and R. Scott Hawley
Properties Use, share, or modify this drill on mathematic properties. There is too much material for a single class, so you’ll have to select for your.
Objectives: Generate and describe sequences. Vocabulary:
David Burdett May 11, 2004 Package Binding for WS CDL.
1 RA I Sub-Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Casablanca, Morocco, 20 – 22 December 2005 Status of observing programmes in RA I.
Properties of Real Numbers CommutativeAssociativeDistributive Identity + × Inverse + ×
Custom Statutory Programs Chapter 3. Customary Statutory Programs and Titles 3-2 Objectives Add Local Statutory Programs Create Customer Application For.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt BlendsDigraphsShort.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
1. Name the particles in the atom and give the charges associated with each.
1 Click here to End Presentation Software: Installation and Updates Internet Download CD release NACIS Updates.
REVIEW: Arthropod ID. 1. Name the subphylum. 2. Name the subphylum. 3. Name the order.
Break Time Remaining 10:00.
Turing Machines.
Table 12.1: Cash Flows to a Cash and Carry Trading Strategy.
PP Test Review Sections 6-1 to 6-6
Bright Futures Guidelines Priorities and Screening Tables
EIS Bridge Tool and Staging Tables September 1, 2009 Instructor: Way Poteat Slide: 1.
An Application of Linear Programming Lesson 12 The Transportation Model.
Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Outline Minimum Spanning Tree Maximal Flow Algorithm LP formulation 1.
Bellwork Do the following problem on a ½ sheet of paper and turn in.
Exarte Bezoek aan de Mediacampus Bachelor in de grafische en digitale media April 2014.
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Basel-ICU-Journal Challenge18/20/ Basel-ICU-Journal Challenge8/20/2014.
1..
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
© 2012 National Heart Foundation of Australia. Slide 2.
Adding Up In Chunks.
The Chemicals of Living Cells ©The Wellcome Trust.
1 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt 10 pt 15 pt 20 pt 25 pt 5 pt Synthetic.
Artificial Intelligence
Copyright Pearson Prentice Hall
1 Using Bayesian Network for combining classifiers Leonardo Nogueira Matos Departamento de Computação Universidade Federal de Sergipe.
Note to the teacher: Was 28. A. to B. you C. said D. on Note to the teacher: Make this slide correct answer be C and sound to be “said”. to said you on.
Model and Relationships 6 M 1 M M M M M M M M M M M M M M M M
Subtraction: Adding UP
Problem #1 E Mathboat.com.
: 3 00.
1 hi at no doifpi me be go we of at be do go hi if me no of pi we Inorder Traversal Inorder traversal. n Visit the left subtree. n Visit the node. n Visit.
Analyzing Genes and Genomes
1 Let’s Recapitulate. 2 Regular Languages DFAs NFAs Regular Expressions Regular Grammars.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Converting a Fraction to %
Clock will move after 1 minute
Intracellular Compartments and Transport
PSSA Preparation.
Essential Cell Biology
Immunobiology: The Immune System in Health & Disease Sixth Edition
Physics for Scientists & Engineers, 3rd Edition
Energy Generation in Mitochondria and Chlorplasts
Select a time to count down from the clock above
Murach’s OS/390 and z/OS JCLChapter 16, Slide 1 © 2002, Mike Murach & Associates, Inc.
How to create Magic Squares
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Presentation transcript:

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism and Signaling Edda Klipp Humboldt University Berlin Lecture 6 / WS 2007/08 Elementary Modes

VL Netzwerke, WS 2007/08 Edda Klipp 2 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Metabolic Networks: Definitions repeated

VL Netzwerke, WS 2007/08 Edda Klipp 3 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Metabolic Networks: Constraints

VL Netzwerke, WS 2007/08 Edda Klipp 4 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Metabolic Networks: Pathways

VL Netzwerke, WS 2007/08 Edda Klipp 5 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Metabolic Networks: Elementary Flux Modes

VL Netzwerke, WS 2007/08 Edda Klipp 6 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Flux Modes: Definitions

VL Netzwerke, WS 2007/08 Edda Klipp 7 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Flux Modes: Example

VL Netzwerke, WS 2007/08 Edda Klipp 8 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Flux Modes and Extreme Pathways

VL Netzwerke, WS 2007/08 Edda Klipp 9 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Elementary Flux Modes: Properties

VL Netzwerke, WS 2007/08 Edda Klipp 10 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Convex Analysis: General Problem

VL Netzwerke, WS 2007/08 Edda Klipp 11 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Schusters Algorithm 1. Start with the tableau I for book-keeping or Schuster, S. et al, 2002, J Math Biol, 45,

VL Netzwerke, WS 2007/08 Edda Klipp 12 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Schusters Algorithm

VL Netzwerke, WS 2007/08 Edda Klipp 13 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Schusters Algorithm

VL Netzwerke, WS 2007/08 Edda Klipp 14 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Schusters Algorithm METATOOL

VL Netzwerke, WS 2007/08 Edda Klipp 15 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Pathway Analysis: Application

VL Netzwerke, WS 2007/08 Edda Klipp 16 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Pathway Analysis: Application

VL Netzwerke, WS 2007/08 Edda Klipp 17 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application: Example Network

VL Netzwerke, WS 2007/08 Edda Klipp 18 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application: Example Network

VL Netzwerke, WS 2007/08 Edda Klipp 19 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application: Example Network

VL Netzwerke, WS 2007/08 Edda Klipp 20 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 1: Pathway Lenghts

VL Netzwerke, WS 2007/08 Edda Klipp 21 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 1: Pathway Lenghts

VL Netzwerke, WS 2007/08 Edda Klipp 22 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 2: Optimal Yields

VL Netzwerke, WS 2007/08 Edda Klipp 23 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 2: Optimal Yields

VL Netzwerke, WS 2007/08 Edda Klipp 24 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 3: Essential Genes

VL Netzwerke, WS 2007/08 Edda Klipp 25 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 4: Minimal Cut Sets

VL Netzwerke, WS 2007/08 Edda Klipp 26 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 4: Minimal Cut Sets

VL Netzwerke, WS 2007/08 Edda Klipp 27 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 4: Minimal Cut Sets

VL Netzwerke, WS 2007/08 Edda Klipp 28 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EFM Application 4: Minimal Cut Sets

VL Netzwerke, WS 2007/08 Edda Klipp 29 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Elementary Modes: Biological Example Study of redundancy and yield of salvage pathways in human erythrocytes. These cells are not able to synthesize ATP de novo. Instead: the salvage (recycling) of certain nucleosides or bases to give nucleotide triphosphates is operative. As the salvage pathways use enzymes consuming ATP as well as enzymes producing ATP, it is not easy to see whether a net synthesis of ATP is possible. As for pathways using adenosine, a straightforward assumption is that these pathways start with adenosine kinase. However, a pathway bypassing this enzyme and using S-adenosylhomocysteine hydrolase instead was reported. Compute Elementary Flux Modes to compute salvage pathways and stoichiometry of ATP build-up from recycled substrates Salvage – bergen, verwerten

VL Netzwerke, WS 2007/08 Edda Klipp 30 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Erythrocyte Metabolism Model representing glycolysis, the pentose phosphate pathway and purine metabolism in red blood cells, including a methyltransferase and two possible ways of operation of S- adenosylhomocysteine hydrolase (SAHH1 and SAHH2). Transport reactions of adenine and adenosine across the cell membrane are not shown for simplicitys sake. 34 Enzymes 45 Metabolites

VL Netzwerke, WS 2007/08 Edda Klipp 31 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EM Producing ATP from Adenine The ATP glucose yields (that is, the ratios of ATP production over glucose consumption fluxes) of modes II.1-II.4 are 2 : 7, 1 : 6, 1 : 4 and 3 : 10, respectively. Note that these are the yields for the buildup of ATP from adenine rather than from ADP as usually indicated for glycolysis. Mode II.4 has the highest yield.

VL Netzwerke, WS 2007/08 Edda Klipp 32 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EM producing ATP from Adenosine The ATP adenosine yields of the ATP-producing modes are 1 for modes III.1-III.3, 1 : 4, 2 : 5, 1 : 4, 1 : 4, 8 : 17, 5 : 14, 2 : 3, 1 : 4 and 5 : 8 for modes III.4-III.12, respectively. Thus, modes starting from glucose and adenosine transform the latter completely into ATP, which implies that glucose is the only energy source. By contrast, in the modes starting solely from adenosine, part of this substrate is used as an energy source, so that the yield is lower.

VL Netzwerke, WS 2007/08 Edda Klipp 33 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Additional ATP Producing Modes Through SAHH1, but not SAHH2: 12 EM Through SAHH1 and SAHH2: 7 EM Through SAHH2 only: 4 EM In presence of SAHH (but not methyltransferase): 14 EM On the basis of elementary flux modes analysis, it can be said that, even though not easily provable experimentally, the rarely mentioned route via SAHH is rather important. It gives additional opportunities to the cell for generating ATP.

VL Netzwerke, WS 2007/08 Edda Klipp 34 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics A Previously Unknown Metabolic Pathway Glucose AcCoA Cit IsoCit OG SucCoA PEP Oxac Mal Fum Succ Gly Pyr CO 2 Reaction system of 24 reactions: TCA cycle, glyoxylate shunt some amino acid synthesis 26 elementary modes were obtained One EM is a combination of the glyoxylate shunt (isocitrate lyase and malate synthase) with part of the Krebs cycle and involves, in addition, phosphoenolpyruvate (PEP) carboxykinase. Oxaloacetate (OAA) is consumed in equimolar amounts by citrate synthase and PEP carboxykinase. Pathway predicted in Schuster et al. (1999) and similarly in Liao et al. (1996) and later found experimentally (Fischer and Sauer, 2003) ADP + FAD + 4 NAD + 2-phosphoglycerate ATP + FADH2 + 4 NADH + 3 CO2. Overall stoichiometry of that EM:

VL Netzwerke, WS 2007/08 Edda Klipp 35 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EM and Robustness: E.coli Metabolism Robustness and fragility are not predicted by a pure graph-theoretical measure of network topology. In contrast to the network diameter, elementary modes reflect specific characteristics of metabolism such as molar yields. Here: tackled the question whether the number of elementary modes N directly relates to network robustness. As a measure for robustness, they used the maximal growth yield for each mutant. Counting the number of cases for which Y max ( i)>0 gave the number of viable single-gene mutants for each substrate regime, that is, a measure of the probability to tolerate random deletion mutations.

VL Netzwerke, WS 2007/08 Edda Klipp 36 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EM and Robustness: E.coli Metabolism Metabolic network topology and phenotype. a, Relative number of elementary modes N enabling deletion mutants in gene i ( i) of E. coli to grow (abbreviated by ) for 90 different combinations of mutation and carbon source. The solid line separates experimentally determined mutant phenotypes, namely inviability (experiments 1–40) from viability (experiments 41–90). Dashed lines delimit the situations with erroneous predictions. b, Dependency of the mutants maximal growth yield Y max ( i ) (open circles) and the network diameter D( i ) (open squares) on the share of elementary modes operational in the mutants. Data were binned to reduce noise. c, Distribution of growth supporting elementary modes in wild type, that is, share of modes having a specific biomass yield (the dotted line indicates equal distribution). d, Effect of arbitrary single-gene deletions on viability for single substrate uptake (open circles) assessed by the mutants maximal growth yields as in b, but considering the numbers of cases in which Y max ( i)>0, and relating them to the total number of modes for the four substrates in wild type

VL Netzwerke, WS 2007/08 Edda Klipp 37 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics EM and Robustness, E.coli Metabolism

VL Netzwerke, WS 2007/08 Edda Klipp 38 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 1: Limited Applicability

VL Netzwerke, WS 2007/08 Edda Klipp 39 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 2: Combinatorial Complexity

VL Netzwerke, WS 2007/08 Edda Klipp 40 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 2: Combinatorial Complexity

VL Netzwerke, WS 2007/08 Edda Klipp 41 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 2: Combinatorial Complexity

VL Netzwerke, WS 2007/08 Edda Klipp 42 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 2: Combinatorial Complexity

VL Netzwerke, WS 2007/08 Edda Klipp 43 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 2: Combinatorial Complexity Subnetworks from the metabolic networks of T.pallidum. (a) Shows the part of the hierarchy tree that (b) corresponds to. Grey substance names show where shortest paths to the hubs (most connected substances of the network) enter.

VL Netzwerke, WS 2007/08 Edda Klipp 44 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 3: Feasibility of EFMs?

VL Netzwerke, WS 2007/08 Edda Klipp 45 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Caveat 3: Feasibility of EFMs?